Makespan minimization for a 2-stage assembly scheduling problem subject to component available time constraint

[1]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

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

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

[4]  Jwm Will Bertrand,et al.  Production control in engineer-to-order firms , 1993 .

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

[6]  C. Potts,et al.  A branch and bound algorithm for the two-stage assembly scheduling problem , 1997 .

[7]  Rainer Kolisch,et al.  Integration of assembly and fabrication for make-to-order production , 2000 .

[8]  Christos Koulamas,et al.  The three-stage assembly flowshop scheduling problem , 2001, Comput. Oper. Res..

[9]  Ali Tozkapan,et al.  A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem , 2003, Comput. Oper. Res..

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

[11]  Chris N. Potts,et al.  Batching decisions for assembly production systems , 2004, Eur. J. Oper. Res..

[12]  Bertrand M. T. Lin,et al.  Scheduling in an assembly-type production chain with batch transfer , 2007 .

[13]  C. Sung,et al.  A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times , 2008 .