An algorithm for minimizing weighted earliness penalty in assembly job shops

Abstract This paper addresses the problem of minimizing the weighted earliness penalty in assembly job shops. A job in the shop is assumed to have a tree product structure consisting of components and subassemblies and that each component or subassembly may need additional processing before it can mate with other parts. As is typical in just-in-time production, no tardy job is allowed. Because of the computational time intensity associated with the problem, a heuristic was developed to solve the problem. Optimality conditions were derived and used in the development of the heuristic. The heuristic decomposes the problem into several single machine problems. Solutions to the single machine problems were used to construct the solution to the original problem. The effectiveness of the heuristic was evaluated by solving a set of test problems. The results of the test problems demonstrated that the heuristic is effective in solving the problem.

[1]  A. G. Lagodimos,et al.  Scheduling a multi-stage fabrication shop for efficient subsequent assembly operations , 2004 .

[2]  R. King,et al.  Minimizing L max for the single machine scheduling problem with family set-ups , 2004 .

[3]  Wilbert E. Wilhelm,et al.  An evaluation of heuristics for allocating components to kits in small-lot, multi-echelon assembly systems , 1993 .

[4]  Pius J. Egbelu,et al.  Scheduling for machining and assembly in a job-shop environment , 1993 .

[5]  T. C. Edwin Cheng,et al.  Two-stage flowshop earliness and tardiness machine scheduling involving a common due window , 2004 .

[6]  J.W. Fowler,et al.  Heuristics for minimizing total weighted tardiness in complex job shops , 2005 .

[7]  Masao Yokoyama,et al.  Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times , 2005, Eur. J. Oper. Res..

[8]  D. H. Cummings,et al.  Minimizing production flow time in a process and assembly job shop , 1998 .

[9]  Dion H. Cummings Mckoy.  Production scheduling in a process and assembly job shop , 1999 .

[10]  Pupong Pongcharoen,et al.  Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products , 2002 .

[11]  Wilbert E. Wilhelm,et al.  Optimizing the allocation of components to kits in small‐lot, multiechelon assembly systems , 1994 .

[12]  Chengbin Chu,et al.  Parallel machine scheduling to minimize total tardiness , 2002 .

[13]  Thom J. Hodgson,et al.  Minimizing L max for large-scale, job-shop scheduling problems , 2004 .

[14]  Rainer Leisten,et al.  A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness , 2006 .

[15]  Salah E. Elmaghraby,et al.  Sequencing precedence-related jobs on two machines to minimize the weighted completion time , 2006 .

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

[17]  Masao Yokoyama,et al.  Scheduling for two-stage production system with setup and assembly operations , 2004, Comput. Oper. Res..

[18]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[19]  Tapan Sen,et al.  Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey , 2003 .

[20]  Xi Sun,et al.  Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling , 2003, Eur. J. Oper. Res..

[21]  Supachai Pathumnakul,et al.  Scheduling based on earliness and tardiness criteria in assembly job shops , 2000 .