A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion

International Journal of Advanced Manufacturing Technology

Volumn 38, Issue 3-4, 2008, Pages 337-347

  Pan, Quan Ke ^a,b   Wang, Ling ^c   Tasgetiren, M Fatih ^d   Zhao, Bao Hua ^a  

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

^b LIAOCHENG UNIVERSITY   (China)

^c TSINGHUA UNIVERSITY   (China)

^d SULTAN QABOOS UNIVERSITY   (Oman)

Author keywords

Insert neighborhood; Local search; Makespan; No wait flow shop; Particle swarm optimization

Indexed keywords

ALGORITHMS; BENCHMARKING; LEARNING ALGORITHMS; MACHINE SHOP PRACTICE; MACHINE SHOPS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS;

COMPLETION TIME; COMPUTATIONAL SIMULATIONS; DISCRETE PARTICLE SWARM OPTIMIZATION; DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM; HYBRID PARTICLE SWARM OPTIMIZATION; INSERT NEIGHBORHOOD; JOB PERMUTATION; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MAKESPAN; MAKESPAN CRITERION; NO WAIT FLOW SHOPS; NO-WAIT FLOW SHOP; PARTICLE SWARM OPTIMIZATION; PERMUTATION REPRESENTATIONS; SEARCHING ABILITY; SPEED UPS; STATISTICAL PERFORMANCES;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 49349115620     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-1099-4     Document Type: Article

References (37)

1. Pan QK, Tasgetiren MF, Liang YC (2006) Minimizing total earliness and tardiness penalties with a common due date on a single-machine using a discrete particle swarm optimization algorithm. LNCS 4150:460-467
2. Pan QK, Tasgetiren MF, Liang YC (2005) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion, in Proceedings of the international workshop on UK planning and scheduling special interest group, UK PLANSIG2005. City University, London, pp: 31-41
3. Li BB, Wang L (2007) A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 37:576-591
4. Wang L, Zheng DZ (2003) An effective hybrid heuristic for flow shop scheduling. Int J Adv Manuf Technol 21:38-44
5. Liu B, Wang L, Jin YH (2007) An effective hybrid particle swarm optimization for no-wait flow shop scheduling. Int J Ada Manuf Technol 31:1001-1011
6. Stadtler H (2005) Supply chain management and advanced planning-basics, overview and challenges. Eur J Oper Res 163:575-588
7. Dimopoulos C, Zalazala AMS (2000) Recent development in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons. IEEE Trans Evolut Comput 4:93-113
8. Wang L (2003) Shop scheduling with genetic algorithms. Tsinghua Univ 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 W, Hoogeveen J (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 flowshop problem is NP-complete. J Assoc Comput Machinery 31:336-345
14. Bonney MC, Gundry SW (1976) Solutions to the constrained flowshop sequencing problem. Operational Research Quarterly 24: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 no-wait flowshop. Int J Prod Econ 32:285-290
17. Rajendran C (1994) A no-wait flowshop scheduling heuristic to minimize makespan. J Oper Res Soc 45:472-478
18. Aldowaisan T, Allahverdi (2003) New heuristics for no-wait flowshops to minimize makespan. Comput Oper Res 30:1219-1231
19. Schuster CJ, Framinan JM (2003) Approximative procedure for no-wait job shop scheduling. Oper Res Lett 31:308-318
20. Grabowski J, Pempera J (2005) Some local search algorithms for no-wait flow-shop problem with makespan criterion. Comput Oper Res 32:2197-2212
21. Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. Proceedings of the sixth international symposium on micro machine and human science, Nagoya, Japan, pp. 39-43
22. Abido MA (2002) Optimal power flow using particle swarm optimization. Electrical Power and Energy Systems 24:563-571
23. Brandstatter B, Baumgartner U (2002) Particle swarm optimization-mass- spring system analogon. IEEE Trans Magn 38:997-1000
24. Salman A, Ahmad I, Al-Madani S (2003) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26:363-371
25. Tasgetiren MF, Liang YC (2003) A binary particle swarm optimization algorithm for lot sizing problem. J Econ Soc Res 5:1-20
26. He Q, Wang L (2007) A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl Math Comput 186:1407-1422
27. Liu B, Wang L, Jin YH (2007) An eeffective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans Syst, Man and Cybern, B, Cybern 37:18-27
28. Tasgetiren MF, Liang YC, Sevkli M et al (2007) Particle swarm optimization algorithm for makespan and total flowtime minimization in permutation flowshop sequencing problem. Eur J Oper Res 177:1930-1947
29. Onwubolu GC, Clerc M (2004) Optimal operating path for automated drilling operations by a new heuristic approach using particle swarm optimization. Int J Prod Res 42(3):473-491
30. Kennedy J, Eberhart RC, Shi Y (2001) Swarm intelligence, 2001, Morgan Kaufmann, San Mateo, CA, USA
31. Kalczynski PJ, Kamburowski J (2007) On no-wait and no-idle flow shops with makespan criterion. Eur J Oper Res 178:677-685
32. 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
33. Ruiz R, Stutzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177:2033-2049
34. Osman I, Potts C (1989) Simulated annealing for permutation flow shop scheduling. OMEGA 17:551-557
35. Carlier J (1978) Ordonnancements a contraintes disjonctives. RAIRO Recherche operationelle 12:333-351
36. Reeves C (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22:5-13
37. Heller J (1960) Some numerical experiments for an M×J flow shop and its decision-theoretical aspects. Oper Res 8:178-184