An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion

International Journal of Advanced Manufacturing Technology

Volumn 38, Issue 7-8, 2008, Pages 778-786

  Pan, Quan Ke ^a,b   Wang, Ling ^c   Zhao, Bao Hua ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b LIAOCHENG UNIVERSITY   (China)

^c TSINGHUA UNIVERSITY   (China)

Author keywords

Insert neighborhood; Iterated greedy algorithm; Local search; Makespan; No wait flow shop; Speed up method

Indexed keywords

MACHINE SHOP PRACTICE; SCHEDULING;

GREEDY ALGORITHMS; INSERT NEIGHBORHOOD; ITERATED GREEDY ALGORITHM; LOCAL SEARCH; MAKESPAN; MAKESPAN CRITERION; NO WAIT FLOW SHOPS; NO-WAIT FLOW SHOP; SPEED UPS; SPEED-UP METHOD;

OPTIMIZATION;

EID: 49649122428     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-1120-y     Document Type: Article

References (30)

1. Stadtler H (2005) Supply chain management and advanced planning-basics, overview and challenges. Eur J Oper Res 163(3):575-588
2. Pan Q-K, Tasgetiren MF, Liang Y-C (2005) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion. In: Proceedings of the 24th Annual Workshop of the UK Planning and Scheduling Special Interest Group (UK PlanSIG 2005), London, UK, December 2005, pp 31-41
3. Wang L, Zheng D-Z (2003) An effective hybrid heuristic for flow shop scheduling. Int J Adv Manuf Technol 21(1):38-44
4. Dimopoulos C, Zalazala AMS (2000) Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons. IEEE Trans Evolut Comput 4(2):93-113
5. Liu B, Wang L, Jin Y-H (2007) An effective hybrid particle swarm optimization for no-wait flow shop scheduling. Int J Adv Manuf Technol 31:1001-1011
6. Pan Q-K, Tasgetiren MF, Liang Y-C (2006) Minimizing total earliness and tardiness penalties with a common due date on a single-machine using a discrete particle swarm optimization algorithm. Lect Notes Comput Sci 4150:460-467
7. Li B-B, Wang L (2007) A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling. IEEE Trans Syst Man Cybern B Cybern 37:576-591
8. Wang L (2003) Shop scheduling with genetic algorithms. Tsinghua University Press, Beijing, China
9. Rajendran C (1994) A no-wait flowshop scheduling heuristic to minimize makespan. J Oper Res Soc 45:472-478
10. Hall NG, Sriskandarayah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44:510-525
11. Grabowski J, Pempera J (2000) Sequencing of jobs in some production system. Eur J Oper Res 125:535-550
12. Raaymakers WHM, Hoogeveen JA (2000) Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. Eur J Oper Res 126:131-151
13. Rock H (1984) The three-machine no-wait flow shop problem is NP-complete. J Assoc Comput Machinery 31:336-345
14. Bonney MC, Gundry SW (1976) Solutions to the constrained flowshop sequencing problem. Oper Res Q 27:869-883
15. King JR, Spachis AS (1980) Heuristics for flowshop scheduling. Int J Prod Res 18:343-357
16. Gangadharan R, Rajedran C (1993) Heuristic algorithms for scheduling in the no-wait flowshop. Int J Prod Econ 32:285-290
17. Aldowaisan T, Allahverdi A (2003) New heuristics for no-wait flowshops to minimize makespan. Comput Oper Res 30:1219-1231
18. Schuster CJ, Framinan JM (2003) Approximative procedures for no-wait job shop scheduling. Oper Res Lett 31:308-318
19. Grabowski J, Pempera J (2005) Some local search algorithms for no-wait flow-shop problem with makespan criterion. Comput Oper Res 32:2197-2212
20. Ruiz R, Stützle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177:2033-2049
21. Jacobs LW, Brusco MJ (1995) A local-search heuristic for large set-covering problems. Nav Res Logist Q 42(7):1129-1140
22. Marchiori E, Steenbeek A (2000) An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. Lect Notes Comput Sci 1803:367-381
23. Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega 11:91-95
24. Koulamas C (1998) A new constructive heuristic for the flowshop scheduling problem. Eur J Oper Res 105:66-71
25. Turner S, Booth D (1987) Comparison of heuristics for flow shop sequencing. Omega 15(1):75-85
26. Carlier J (1978) Ordonnancements à contraintes disjonctives. RAIRO Rech Oper 12:333-351
27. Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22:5-13
28. Heller J (1960) Some numerical experiments for an M×J flow shop and its decision-theoretical aspects. Oper Res 8:178-184
29. Osman IH, Potts CN (1989) Simulated annealing for permutation flow-shop scheduling. Omega 17(6):551-557
30. Wang L, Zheng D-Z (2001) An effective hybrid optimization strategy for job-shop scheduling problems. Comput Oper Res 28(6):585-596