Solvable cases of permutation flowshop scheduling with dominating machines

International Journal of Production Economics

Volumn 66, Issue 1, 2000, Pages 53-57

  Xiang, S ^a   Tang, G ^b   Cheng, T C E ^c  

^a Faculty of Civil Engineering   (China)

^b SHANGHAI SECOND POLYTECHNIC UNIVERSITY   (China)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Dominating machines; Permutation flowshop; Scheduling

Indexed keywords

EID: 0042639540     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(99)00106-1     Document Type: Article

References (9)

1. I. Adiri, N. Aizikowitz (Hefetz), Open-shop scheduling problems with dominated machines, Naval Research Logistics 26 (1989) 273-281.
2. I. Adiri, N. Amit, Openshop and flowshop scheduling to minimize the sum of completion times, Computers and Operations Research 11 (3) (1984) 275-284.
3. I. Adiri, D. Pohoryles, Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times, Naval Research Logistics Quarterly 29 (1982) 495-504.
4. J.N.D. Gupta, M. Ikram, Optimal schedules for two special structure flowshops, 1977, unpublished paper.
5. J.C. Ho, J.N.D. Gupta, Flowshop scheduling with dominant machines, Computers and Operations Research 22 (2) (1995) 237-246.
6. C.I. Monma, A.H.G. Rinnooy Kan, A concise survey of efficiently solvable special cases of the permutation flowshop problem, RAIRO 17 (1983) 105-119.
7. M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995.
8. K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
9. J.M. Moore, An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management Science 15 (1968) 102-109.