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

European Journal of Operational Research

Volumn 106, Issue 1, 1998, Pages 95-100

  Koulamas, Christos ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

Due dates; Flowshop; Scheduling

Indexed keywords

EID: 0041171837     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00323-3     Document Type: Article

References (17)

1. S.M. Johnson, Optimal two and three-stage production schedule with setup times included, Naval Research Logistics Quarterly 1 (1954) 61-68.
2. M.R. Garey, D.S. Johnson, R. Sethi, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research 1 (1976) 117-129.
3. J.K. Lenstra, A.H.G. Rinnooy Kan, P. Brucker, Complexity of machine scheduling problems, Annals of Discrete Mathematics 1 (1977) 343-362.
4. A.M.A. Hariri, C.N. Potts, A branch and bound algorithm to minimize the number of late jobs in a permutation flowshop, European Journal of Operational Research 38 (1989) 228-237.
5. W. Townsend, Sequencing n jobs on m machines to minimize maximum tardiness: A branch-and-bound solution, Management Science 23 (1977) 1016-1019.
6. T. Sen, P. Dileepan, J.N.D. Gupta, The two-machine flowshop scheduling problem with total tardiness, Computers and Operations Research 16 (1989) 333-340.
7. Y.D. Kim, A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops, Computers and Operations Research 20 (1993) 391-401.
8. K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
9. J.O. Achugbue, F.Y. Chin, Complexity and solutions of some three-stage flow shop scheduling problems, Mathematics of Operations Research 7 (1982) 532-544.
10. M.L. Smith, S.S. Panwalkar, R.A. dudek, Flowshop sequencing problem with ordered processing time matrices, Management Science 21 (1975) 544-549.
11. J.C. Ho, J.N.D. Gupta, Flowshop scheduling with dominant machines, Computers and Operations Research 22 (1995) 237-246.
12. J.M. Moore, An n job one machine sequencing algorithm for minimizing the number of late jobs, Management Science 14 (1968) 102-109.
13. J. Du, J.Y.T. Leung, Minimizing total tardiness on one machine is NP-hard, Mathematics of Operations Research 15 (1990) 483-495.
14. C. Chu, A branch-and-bound algorithm to minimize total tardiness with different release dates, Naval Research Logistics 39 (1992) 265-283.
15. S.S. Panwalkar, A.W. Khan, An ordered flow-shop sequencing problem with mean completion time criterion, International Journal of Production Research 14 (1976) 631-635.
16. J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Science Research Project, UCLA, 1955.
17. S.S. Johnson, Optimal two and three stage production schedules with set-up times included, Naval Research Logistics Quarterly 1 (1954) 61-68.