Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines

This paper analyses a deterministic scheduling problem concerned with manufacturing two types of components at a pre-assembly stage which consists of two independent feeding machines each producing its own type of component. Each type represents a unique component which may have variations in its size or quality. Therefore, the completion time of each component depends on both its type and quality (size) variations. Such manufactured components are subsequently assembled into various component-dependent products. The problem has the objective measure of minimizing the total weighted completion time of a finite number of jobs (products) where the completion time of each job is measured by the latest completion time of its two components at the pre-assembly stage. The problem is shown to be NP-complete in the strong sense. A WSPT rule coupled with a machine-aggregation idea is developed for good heuristics which show the error bound of 2. Some empirical evaluations for the average-case performance of the heuristics are also performed.

[1]  C S Sung,et al.  Scheduling of Products with Common and Product-Dependent Components Manufactured at a Single Facility , 1993 .

[2]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[3]  Stephen G. Powell,et al.  Optimal Allocation of Work in Assembly Systems , 1993 .

[4]  אסתר טולידנו מקבלי דמי אבטלה בשנת 1991 , 1992 .

[5]  Andrew Kusiak,et al.  Performance analysis of modular products , 1996 .

[6]  דליה גורדון ותמר אליאב משפחות חד הוריות, 1991 , 1992 .

[7]  Stephen G. Powell,et al.  A predictive model for the throughput of simple assembly systems , 1995 .

[8]  תמר אליאב ולאה ענבר גמלאות אמהות 1990/91 , 1992 .

[9]  Y. P. Aneja,et al.  Scheduling production of common components at a single facility , 1990 .

[10]  Mihalis Yannakakis,et al.  Optimal Scheduling of Products with Two Subassemblies on a Single Machine , 1989, Oper. Res..

[11]  Izak Duenyas,et al.  Estimating the throughput of a cyclic assembly system , 1994 .

[12]  Rhonda R. Lummus A simulation analysis of sequencing alternatives for JIT lines using kanbans , 1995 .

[13]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

[16]  H. W. Stoll Design for Manufacture: An Overview , 1986 .

[17]  G. Boothroyd,et al.  Assembly Automation and Product Design , 1991 .

[18]  Daniel E. Whitney,et al.  Nippondenso Co. Ltd: A case study of strategic product design , 1993 .