Scheduling in the two-machine flowshop with due date constraints

International Journal of Production Economics

Volumn 70, Issue 2, 2001, Pages 117-123

  Lin, Bertrand M T ^a  

^a MING CHUAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIALS; PROBLEM SOLVING; PROCESS ENGINEERING; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING;

DUE DATE CONSTRAINTS; FLOWSHOPS; POLYNOMIAL-TIME REDUCTIONS;

PRODUCTION CONTROL;

EID: 0035276570     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(00)00048-7     Document Type: Article

References (12)

1. S.M. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly 1 (1954) 61-67.
2. M. Pinedo, Scheduling Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995.
3. A. Reisman, A. Kumar, J. Motwani, Flowshop scheduling/sequencing research: A statistical review of the literature, 1952-1994, IEEE Transactions on Engineering Management 44 (1997) 316-329.
4. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 445-522.
5. J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Research Report 43, Management Science Research Project, UCLA, 1955.
6. J.M. Moore, An n job one machine sequencing algorithm for minimizing the number of tardy job, Management Science 15 (1968) 102-109.
7. J.K. Lenstra, A.H.G. Rinnooy Kan, P. Bruker, Complexity of machine scheduling problems, Annals of Discrete Mathematics 1 (1977) 343-362.
8. J.N.D. Gupta, A.M.A. Hariri, Two-machine flowshop scheduling to minimize the number of tardy jobs, Journal of the Operations Research Society 48 (1997) 212-220.
9. J.C. Ho, J.N.D. Gupta, Flowshop scheduling with dominant machines, Computers and Operations Research 22 (1995) 237-246.
10. C. Koulamas, On the complexity of two-machine flowshop problems with due date related objectives, European Journal of Operational Research 106 (1998) 95-100.
11. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of script N signscript P sign-Completeness, Freedman, San Francisco, CA, 1979.
12. T.C.E. Cheng, J.N.D. Gupta, G. Wang, A review of flow-shop scheduling research with setup times, Production and Operations Management (2000), to appear.