Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time

Applied Mathematics and Computation

Volumn 182, Issue 1, 2006, Pages 947-954

  Wang, Ji Bo ^a   Shan, Feng ^a   Jiang, Bo ^a   Wang, Li Yan ^a  

^a SHENYANG AEROSPACE UNIVERSITY   (China)

Author keywords

Discounted total weighed completion time; Flow shop; Polynomial time algorithm; Scheduling

Indexed keywords

ALGORITHMS; POLYNOMIALS; SCHEDULING; WEIGHING;

COMPLETION TIME; DOMINANT MACHINES; FLOW SHOPS; POLYNOMIAL TIME ALGORITHMS;

PROBLEM SOLVING;

EID: 33750799908     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.04.052     Document Type: Article

References (14)

1. Adiri I., and Pohoryles D. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics Quarterly 29 (1982) 495-504
2. Čepek O., Okada M., and Vlach M. Nonpreemptive flowshop scheduling with machine dominance. European Journal of Operational Research 139 (2002) 245-261
3. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 (1976) 117-129
4. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
5. Ho J.C., and Gupta J.N.D. Flowshop scheduling with dominant machines. Computers and Operations Research 22 (1995) 237-246
6. Johnson S.M. Optimal two and three stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
7. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
8. Monma C.L., and Rinnooy Kan A.H.G. A concise survey of efficient solvable special cases of the permutation flowshop problem. RAIRO 17 (1983) 105-119
9. Nouweland A.V.D., Krabbenborg M., and Potters J. Flow-shops with a dominant machine. European Journal of Operational Research 62 (1992) 38-46
10. Pinedo M. Scheduling: Theory. Algorithms and Systems (1995), Prentice-Hall, Englewood cliffs, New jersey
11. Rǒck H. The three-machine no-wait flow shop problem is NP-compulete. Journal of the ACM 31 (1984) 336-345
12. Rǒck H. Some new results in flow shop scheduling. Zeitschrift fǔr Operational Research 28 (1984) 1-16
13. Wang J.-B., and Xia Z.-Q. No-wait or no-idle permutation flowshop scheduling with dominating machines. Journal of Applied Mathematics and Computing 17 (2005) 419-432
14. Xiang S., Tang G., and Cheng T.C.E. Solvable cases of permutation flowshop scheduling with dominating machines. International Journal of Production Economics 66 (2000) 53-57