This dissertation addresses the "multi-machine carryover sequence dependent group-scheduling problem with anticipatory setups," which arises in the printed circuit board (PCB) manufacturing. Typically, in PCB manufacturing different board types requiring similar components are grouped together to reduce setup times and increase throughput. The challenge is to determine the sequence of board groups as well as the sequence of individual board types within each group. The two separate objectives considered are minimizing the makespan and minimizing the mean flow time. In order to quickly solve the problem with each of the two objectives, highly effective metasearch heuristic algorithms based on the concept known as tabu search are developed. Advanced features of tabu search, such as the long-term memory function in order to intensify/diversify the search and variable tabu-list sizes, are utilized in the proposed heuristics. In the absence of knowing the actual optimal solutions, another important challenge is to assess the quality of the solutions identified by the proposed metaheuristics. For that purpose, methods that identify strong lower bounds both on the optimal makespan and the optimal mean flow time are proposed. The quality of a heuristic solution is then quantified as its percentage deviation from the lower bound. Based on the minimum possible setup times, this dissertation develops a lower bounding procedure, called procedure Minsetup, that is capable of identifying tight lower bounds. Even tighter lower bounds are identified using a mathematical programming decomposition approach. Novel mathematical programming formulations are developed and a branch-and-price (B&P) algorithm is proposed and implemented. A Dantzig-Wolfe reformulation of the problem that enables applying a column generation algorithm to solve the linear programming relaxation of the master problem is presented. Single-machine subproblems are designed to identify new columns if and when necessary. To enhance the efficiency of the algorithm, approximation algorithms are developed to solve the subproblems. Effective branching rules partition the solution space of the problem at a node where the solution is fractional. In order to alleviate the slow convergence of the column generation process at each node, a stabilizing technique is developed. Finally, several implementation issues such as constructing a feasible initial master problem, column management, and search strategy, are addressed. The results of a carefully designed computational experiment for both low-mix high-volume and high-mix low-volume production environments confirm the high performance of tabu search algorithms in identifying extremely good quality solutions with respect to the proposed lower bounds. / Graduation date: 2006

An integrated circuit processing schedule is presented that enables fabrication of both high speed I²L gates and high voltage linear type transistors on the same silicon starting substrate material. This process design circumvents conflicting processing requirements normally encountered in considering an I²L/Linear compatible structure by providing two separate epitaxial thicknesses for the I²L and linear section of the chip. The electrical characteristics of the I²L cells and the linear transistors are presented to illustrate their dependence on the doping conditions and are shown to be in contrast to each other. As a consequence of the separate epitaxial thicknesses, independence of the processing constraints is achieved. Experimental results of linear transistors and I²L devices fabricated using this processing schedule are presented and compared to calculated and computer simulations. Modifications to the basic process design is shown possible and enhanced performance of I²L devices results.

No description available.

Thesis (M.S.)--Ohio University, August, 1992. / Title from PDF t.p.

Thesis (Ph. D.)--University of Hong Kong, 1998. / Includes bibliographical references.

Thesis (M.S.)--University of Wisconsin--Madison, 1966. / eContent provider-neutral record in process. Description based on print version record. Bibliography: l. 93-94.

No description available.

by Ng Kwok-pui. / Thesis (M.B.A.)--Chinese University of Hong Kong, 1991. / Bibliography: leaves 63-64. / abstract --- p.ii / table of contents --- p.iii / LIST OF ILLUSTRATIONS --- p.vi / acknowledgments --- p.vii / Chapter / Chapter I. --- introduction --- p.1 / Chapter II. --- MANUFACTURING RESOURCES PLANNING (MRPII) AND JUST-IN-TIME (JIT) PHILOSOPHY --- p.5 / MRPII vs JIT: Comments from Two Articles --- p.5 / Manufacturing Resources Planning and Control System (MRPII) in XYZ --- p.7 / Inventory Control --- p.7 / Bills of Materials --- p.8 / Master Production Scheduling --- p.8 / Material Requirements Planning --- p.9 / Routing/Work Center --- p.9 / Capacity Requirements Planning --- p.10 / Shop Floor Control --- p.10 / Cost Accounting --- p.11 / Lot Traceability --- p.11 / Sales Order Processing --- p.12 / Purchasing --- p.12 / Materials Receiving --- p.13 / General Ledger (G/L) --- p.13 / Accounts Receivable (A/R) --- p.13 / Accounts Payable --- p.14 / Payroll --- p.14 / Personnel Management --- p.14 / Fixed Assets Management --- p.15 / CAD/Quotation/BOM System --- p.15 / Export Documentation --- p.15 / Problems with MRPII --- p.15 / What is JIT? --- p.18 / Problems with JIT --- p.21 / Integrating JIT with MRPII --- p.23 / Chapter III. --- HOW CAN A HYBRID SYSTEM OF MRP AND JIT BE APPLIED TO XYZ? --- p.29 / XYZ's Performance in MRPII and JIT --- p.29 / Other Problems with the Production Control System --- p.30 / What Hybrid System will Best Suit XYZ? --- p.32 / Integrating MRPII and JIT through Software Unification --- p.34 / Manufacturing Specifications --- p.36 / Materials Planning --- p.38 / Manufacturing Control --- p.39 / Integration of MRP and JIT --- p.40 / Implication of Software Unification to XYZ? --- p.42 / Chapter IV. --- CONCLUSION --- p.45 / APPENDIXES / Appendix 1 --- p.47 / Appendix 2 --- p.53 / Appendix 3 --- p.58 / BIBLIOGRAPHY --- p.63

published_or_final_version / Industrial and Manufacturing Systems Engineering / Doctoral / Doctor of Philosophy

No description available.