On the complexity of two-machine flowshop problems with due date related objectives

The complexity of two-machine flowshop problems with due date related criteria is investigated. It is shown that when certain restrictions are imposed on the job processing times and their due dates these problems become polynomially solvable while when these restrictions are slightly weakened the problems remain NP-complete.

[1]  Jatinder N. D. Gupta,et al.  Flowshop scheduling with dominant machines , 1995, Comput. Oper. Res..

[2]  C. Chu.  A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .

[3]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

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

[5]  W. Townsend.  Note---Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution , 1977 .

[6]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[7]  James L. McKenney.  Critique of: "Verification of Computer Simulation Models" , 1967 .

[8]  Francis Y. L. Chin,et al.  Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems , 1982, Math. Oper. Res..

[9]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..

[10]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[11]  R. A. Dudek,et al.  Flowshop Sequencing Problem with Ordered Processing Time Matrices , 1975 .

[12]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[13]  Gilbert Laporte,et al.  Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave , 1989 .

[14]  Chris N. Potts,et al.  A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop , 1989 .

[15]  Jatinder N. D. Gupta,et al.  The two-machine flowshop scheduling problem with total tardiness , 1989, Comput. Oper. Res..

[16]  S. S. Panwalkar,et al.  An ordered flow-shop sequencing problem with mean completion time criterion† , 1976 .

[17]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..