• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 123
  • 48
  • 27
  • 6
  • 6
  • 4
  • 4
  • 4
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • Tagged with
  • 264
  • 264
  • 57
  • 52
  • 46
  • 45
  • 37
  • 37
  • 36
  • 34
  • 29
  • 25
  • 24
  • 24
  • 21
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Control charts interpretation system a protype [sic] expert system for patterns recognition on control charts.

Kuo, Tsuang-Yih. January 1989 (has links)
Thesis (M.S.)--Ohio University, August, 1989. / Title from PDF t.p.
2

Applying manufacturing batch techniques to customer fraud detection /

Zhou, Zhihong. January 2004 (has links)
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004. / Includes bibliographical references (leaves 39-42). Also available in electronic version. Access restricted to campus users.
3

Scheduling and control of manufacturing cycle for introduction of new products

Carroll, James R. January 1964 (has links)
Thesis (M.S.)--University of Wisconsin--Madison, 1964. / eContent provider-neutral record in process. Description based on print version record. Bibliography: l. 87-89.
4

Correcting for data imprecision in MRP2 systems

Naji, Zeyad Tarik January 1991 (has links)
No description available.
5

Computer aided analysis of product manufacturing and quality data

Yong, C. P. January 1984 (has links)
No description available.
6

A comparison study of the role of motivation between multidisciplinary project management and factory production management.

January 1986 (has links)
by Chan Mang-hung & Lee Kwok-sing. / Bibliography: leaves 122-123 / Thesis (M.B.A.)--Chinese University of Hong Kong, 1986
7

The Sensitivity of a constant work-in-process production line with imperfect quality inspection.

January 1992 (has links)
by Lau Tsz Chuen. / Thesis (M.B.A.)--Chinese University of Hong Kong, 1992. / Includes bibliographical references (leaves 58-61). / ABSTRACT --- p.i / TABLE OF CONTENT --- p.ii / LIST OF TABLES --- p.iii / LIST OF FIGURES --- p.iii / Chapter CHAPTER ONE --- INTRODUCTION --- p.1 / Chapter CHAPTER TWO --- LITERATURE REVIEW --- p.6 / JIT AND QUALITY --- p.7 / JIT AND INVENTORY CONTROL --- p.8 / "INSPECTION IMPRECISION, TOLERANCE LIMITS AND PROCESS CAPABILITY" --- p.11 / PHILOSOPHY OF TAGUCHI AND MEASUREMENT IMPRECISION --- p.17 / PROCESSING AND INSPECTION TIME VARIATIONS --- p.19 / RESEARCH OBJECTIVES --- p.19 / SIGNIFICANT OF THE RESEARCH --- p.20 / Chapter CHAPTER THREE --- EXPERIMENTAL DESIGN --- p.23 / HYPOTHESIS STATEMENTS --- p.23 / SIMULATION MODEL --- p.24 / PERFORMANCE MEASURES --- p.26 / SPECIFICATION OF COST PARAMETERS --- p.27 / FACTORIAL DESIGN --- p.27 / Chapter CHAPTER FOUR --- RESULT --- p.30 / TWO-FACTOR INTERACTIONS --- p.35 / THREE-FACTOR INTERACTIONS --- p.41 / Chapter CHAPTER FIVE --- CONCLUSION --- p.46 / RECOMMENDATION FOR FURTHER RESEARCH --- p.47 / APPENDIX --- p.48 / REFERENCES --- p.58
8

A study of the production control methods employed in the Hong Kong spinning industry.

January 1969 (has links)
Lau Ho-fuk. / Summary in Chinese on end papers. / Thesis (M.Comm.)--Chinese University of Hong Kong, 1969. / Bibliography: l. 136-138.
9

A methodology for real-time scheduling of jobs with splitting on unrelated parallel machines

Subur, Fenny 27 April 2000 (has links)
Unrelated parallel machines are machines that perform the same function but have different capacity or capability. Thus, the processing time of each job would be different on machines of different types. The scheduling environment considered is dynamic in both job release time and machine availability. Additionally, each job considered can have different weight, and due date. Split jobs are also considered in this research. The number of jobs that needs to be processed in split-modes is pre-determined and not part of the scheduling decision. Additional constraints are imposed on split jobs to ensure that the absolute difference in completion time of the split portions of a job is within a user-specified margin. These constraints are supported by the Just-In-Time manufacturing concept where inventory has to be maintained at a very low or zero level. The objective of this research is to minimize the sum of the weighted tardiness of all jobs released within the planning horizon. The research problem is modeled as a mixed (binary) integer-linear programming model and it belongs to the class of NP-hard problems. Thus, one cannot rely on using an implicit enumeration technique, such as the one based on branch-and-bound, to solve industry-size problems within a reasonable computation time. Therefore, a higher-level search heuristic, based on a concept known as tabu search, is developed to solve the problems. Four different methods based on simple and composite dispatching rules are used to generate the initial solution that is used by tabu-search as a starting point. Six different tabu-search based heuristics are developed by incorporating the different features of tabu search. The heuristics are tested on eight small problems and the quality of their solutions is compared to their optimal solutions, which are obtained by applying the branch-and-bound technique. The evaluation shows that the tabu-search based heuristics are capable of obtaining solutions of good quality within a much shorter time. The best performer among these heuristics recorded a percentage deviation of only 1.18%. The performance of the tabu-search based heuristics is compared by conducting a statistical experiment that is based on a split-plot design. Three sizes of problem structures, ranging from 9 jobs to 60 jobs and from 3 machines to 15 machines are used in the experiment. The results of the experiment reveal that in comparison to other initial-generation methods, the composite dispatching rule is capable of obtaining initial solutions that significantly accelerate the tabu search based heuristic to get to the final solution. The use of long-term memory function is proven to be advantageous in solving all problem structures. The long-term memory based on maximum-frequency strategy is recommended for solving the small problem structure, while the minimum-frequency strategy is preferred for solving medium and large problem structures. With respect to the use of tabu-list size as a parameter, the variable tabu-list size is preferred for solving the smaller problem structure, but the fixed tabu-list size is preferred as the size of the problems grows from small to medium and then large. / Graduation date: 2000
10

Rule-based control of manufacturing systems

Moi, Havard. January 2000 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2001. / Includes bibliographical references (leaves 286-298).

Page generated in 0.1044 seconds