Makespan minimization in machine dominated flowshop

Applied Mathematics and Computation

Volumn 217, Issue 1, 2010, Pages 110-116

  Easwaran, Gopalakrishnan ^a   Parten, Larry E ^a   Moras, Rafael ^a   Uhlig, Paul X ^a  

^a ST MARY'S UNIVERSITY   (United States)

Author keywords

Combinatorial optimization; Flowshop; Machine dominance; Makespan; Scheduling

Indexed keywords

ELECTRONIC DEVICE; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; MACHINE DOMINANCE; MAKESPAN; MAKESPAN MINIMIZATION; MINIMUM MAKESPAN; NUMERICAL EXAMPLE; SOLUTION APPROACH;

COMBINATORIAL OPTIMIZATION; COMPUTER SCIENCE;

SCHEDULING ALGORITHMS;

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

References (15)

1. M.L. Pinedo Scheduling: Theory, Algorithms, and Systems 2008 Springer New York
2. S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1954 61 68
3. J.C. Ho, and J.N.D. Gupta Flowshop scheduling with dominant machines Computers and Operations Research 22 1995 237 246
4. S. Xiang, G. Tang, and T.C.E. Cheng Solvable cases of permutation flowshop scheduling with dominating machines International Journal of Production Economics 66 2000 53 57
5. J.B. Wang Flow shop scheduling problems with decreasing linear deterioration under dominant machines Computers and Operations Research 34 2007 2043 2058
6. J.B. Wang, F. Shan, B. Jiang, and L.Y. Wang Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time Applied Mathematics and Computation 62 2006 947 954
7. J.B. Wang, and Z.Q. Xia No-wait or no-idle permutation flowshop scheduling with dominating machines Applied Mathematics and Computation 17 2005 419 432
8. J.B. Wang, and Z.Q. Xia Flow shop scheduling problems with deteriorating jobs under dominating machines Journal of the Operational Research Society 57 2006 220 226
9. J.B. Wang, and Z.Q. Xia Flow shop scheduling with deteriorating jobs under dominating machines Omega 34 2006 327 336
10. M. Cheng, S. Sun, and Y. Yu A note on flow shop scheduling problems with a learning effect on no-idle dominant machines Applied Mathematics and Computation 184 2007 945 949 (Pubitemid 46176150)
11. J.B. Wang Erratum to: A note on flow shop scheduling problems with a learning effect on no-idle dominant machines Applied Mathematics and Computation 202 2008 897 898
12. F. Jin, J.N.D. Gupta, S.J. Song, and C. Wu Makespan distribution of permutation flowshop schedules Journal of Scheduling 11 2008 421 432
13. O. Cepek, M. Okada, and M. Vlach Nonpreemptive flowshop scheduling with machine dominance European Journal of Operational Research 139 2002 245 261
14. A.V. Nouweland, M. Krabbenborg, and J. Potters Flowshops with a dominant machine European Journal of Operational Research 62 1992 38 46
15. L.E. Parten, Machine-dominated makespan flowshop scheduling problems, Technical Report, St. Mary's University, San Antonio, TX, 2008.