Makespan minimization for m-machine permutation flowshop scheduling problem with learning considerations

International Journal of Advanced Manufacturing Technology

Volumn 56, Issue 1-4, 2011, Pages 355-367

  Chung, Yu Hsiang ^a   Tong, Lee Ing ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Flowshop; Learning effects; Makespan; Scheduling

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL EXPERIMENT; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; INDUSTRIAL PROBLEM; LEARNING EFFECTS; LOWER BOUNDS; MAKESPAN; MAKESPAN MINIMIZATION; MEAN ERRORS; NEAR-OPTIMAL SOLUTIONS; OPTIMAL SOLUTIONS; PERMUTATION FLOW SHOPS; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; SINGLE MACHINES;

BRANCH AND BOUND METHOD; HEURISTIC ALGORITHMS; OPTIMAL SYSTEMS; SCHEDULING ALGORITHMS;

PROBLEM SOLVING;

EID: 79960972998     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-011-3172-2     Document Type: Article

References (34)

1. Pinedo M (2002) Scheduling: theory, algorithms, and systems. Prentice-Hall, Upper Saddle River
2. WE Smith 1956 Various optimizers for single state production Nav Res Logist Q 3 59 66 10.1002/nav.3800030106
3. D Biskup 1999 Single-machine scheduling with learning considerations Eur J Oper Res 115 173 178 0946.90025 10.1016/S0377-2217(98)00246-X
4. TP Wright 1936 Factors affecting the cost of airplanes J Aeronaut Sci 3 122 128
5. LE Yelle 1979 The learning curve: historical review and comprehensive survey Decis Sci 10 302 328 10.1111/j.1540-5915.1979.tb00026.x
6. TCE Cheng CC Wu WC Lee 2008 Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects Inf Sci 178 2476 2487 2416993 1172.90397 10.1016/j.ins.2008.02.002
7. D Biskup 2008 A state-of-the-art review on scheduling with learning effect Eur J Oper Res 188 315 329 2384086 1129.90022 10.1016/j.ejor.2007.05.040
8. XR Wang JB Wang WJ Gao X Huang 2010 Scheduling with pasr-sequence- dependent setup times and learning effects on single machine Int J Adv Manuf Technol 48 739 746 10.1007/s00170-009-2308-0
9. JB Wang L Sun L Sun 2010 Single machine scheduling with a learning effect a discounted costs Int J Adv Manuf Technol 49 1141 1149 10.1007/s00170-009- 2477-x
10. A Janiak R Rudek 2008 A new approach to the learning effect: beyond the learning curve restrictions Comput Oper Res 35 3727 3736 2586459 1170.90392 10.1016/j.cor.2007.04.007 (Pubitemid 351443072)
11. A Janiak R Rudek 2009 Experience based approach to scheduling problems with the learning effect IEEE Trans Syst Man Cybern, Part A, Syst Humans 39 344 357 10.1109/TSMCA.2008.2010757
12. MD Toksari E Güner 2009 Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration Comput Oper Res 36 2394 2417 1179.90158 10.1016/j.cor.2008.09.012
13. T Eren E Güner 2009 A bicriteria parallel machine scheduling with a learning effect Int J Adv Manuf Technol 40 1202 1205 10.1007/s00170-008-1436-2
14. C Koulamas GJ Kyparisis 2007 Single-machine and two-machine flowshop scheduling with general learning function Eur J Oper Res 178 402 407 2281493 1107.90018 10.1016/j.ejor.2006.01.030 (Pubitemid 44750487)
15. CC Wu PH Hsu JC Chen NS Wang WH Wu 2010 Branch-and-bound and simulated annealing algorithms for a total weighted completion time scheduling with ready time and learning effect Int J Adv Manuf Technol 10.1007/s00170-010-3022-7
16. TCE Cheng PJ Lai CC Wu WC Lee 2009 Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations Inf Sci 179 3127 3135 2588813 1170.90387 10.1016/j.ins.2009.05.002
17. LY Wang JB Wang D Wang N Yin X Huang EM Feng 2009 Single-machine scheduling with a sum-of-processing-time based learning effect and deteriorating jobs Int J Adv Manuf Technol 45 336 340 10.1007/s00170-009-1950-x
18. LY Wang JB Wang WJ Gao X Huang EM Feng 2010 Two single-machine scheduling problems with the effects of deterioration and learning Int J Adv Manuf Technol 46 715 720 10.1007/s00170-009-2145-1
19. Y Yin D Xu K Sun H Li 2009 Some scheduling problems with general position-dependent and time-dependent learning effects Inf Sci 179 2416 2425 2554688 1166.90342 10.1016/j.ins.2009.02.015
20. WC Lee CC Wu 2009 Some single-machine and m-machine flowshop scheduling problems with learning considerations Inf Sci 179 3885 3892 2640777 1179.90141 10.1016/j.ins.2009.07.011
21. CC Wu WC Lee WC Wang 2007 A two-machine flowshop maximum tardiness scheduling problem with a learning effect Int J Adv Manuf Technol 31 743 750 10.1007/s00170-005-0255-y (Pubitemid 46005346)
22. WC Lee CC Wu 2004 Minimizing total completion time in a two-machine flowshop with a learning effect Int J Prod Econ 88 85 93 10.1016/S0925-5273(03) 00179-8
23. P Chen CC Wu WC Lee 2006 A bi-criteria two-machine flowshop scheduling problem with a learning effect J Oper Res Soc 57 1113 1125 1171.90394 10.1057/palgrave.jors.2602095 (Pubitemid 44231543)
24. JB Wang ZQ Xia 2005 Flow-shop scheduling with a learning effect J Oper Res Soc 56 1325 1330 2124582 1082.90041 10.1057/palgrave.jors.2601856 (Pubitemid 41486896)
25. CC Wu WC Lee 2009 A note on the total completion time problem in a permutation flowshop with a learning effect Eur J Oper Res 192 343 347 1180.90144 10.1016/j.ejor.2007.10.003
26. M Nawaz EE Enscore I Ham 1983 A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem OMEGA 11 91 95 10.1016/0305-0483(83)90088-9 (Pubitemid 13193807)
27. S Liu HL Ong 2002 A comparative study of algorithms for the flowshop scheduling problem Asia-Pac J Oper Res 19 205 222 1956422 1165.90463
28. R Ruiz C Maroto 2005 A comprehensive review and evaluation of permutation flowshop heuristics Eur J Oper Res 165 479 494 2121952 1066.90038 10.1016/j.ejor.2004.04.017 (Pubitemid 40206377)
29. C Rajendran H Ziegler 1997 An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs Eur J Oper Res 103 129 138 0922.90089 10.1016/S0377-2217(96)00273-1 (Pubitemid 127396735)
30. HS Woo DS Yim 1998 A heuristic algorithm for mean flowtime objective in flowshop scheduling Comput Oper Res 25 175 182 0904.90090 10.1016/S0305-0548(97) 00050-6
31. JM Framinan R Leisten 2003 An efficient constructive heuristic for flowtime minimization in permutation flow shops OMEGA 31 311 317 10.1016/S0305-0483(03)00047-1 (Pubitemid 36742549)
32. MR Garey DS Johnson R Sethi 1976 The complexity of flowshop and jobshop scheduling Math Oper Res 1 117 129 418895 0396.90041 10.1287/moor.1.2.117
33. CS Chung J Flynn O Kirca 2002 A branch-and-bound algorithm to minimize the total flow time for m-machine permutation flowshop problems Int J Prod Econ 79 185 196 10.1016/S0925-5273(02)00234-7 (Pubitemid 35039850)
34. CS Chung J Flynn O Kirca 2006 A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems Eur J Oper Res 174 1 10 2245923 1116.90116 10.1016/j.ejor.2004.12.023 (Pubitemid 44866836)