A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem

International Journal of Advanced Manufacturing Technology

Volumn 54, Issue 1-4, 2011, Pages 309-322

  Jamili, Amin ^a   Shafia, Mohammad Ali ^a   Tavakkoli Moghaddam, Reza ^b  

^a IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Particle swarm optimization; Periodic event scheduling problem; Periodic job shop scheduling; Simulated annealing

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; CYCLIC SCHEDULING; EFFECTIVE TOOL; FIXED TIME; HYBRID ALGORITHMS; JOB SHOP SCHEDULING PROBLEMS; LOWER BOUNDS; MINIMUM DELAY; PERIODIC EVENT SCHEDULING PROBLEM; PERIODIC EVENT SCHEDULING PROBLEMS; PERIODIC JOB SHOP SCHEDULING; PSO ALGORITHMS; SIMULATED ANNEALING ALGORITHMS;

ALGORITHMS; PARTICLE SWARM OPTIMIZATION (PSO);

SIMULATED ANNEALING;

EID: 79955655281     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-2932-8     Document Type: Article

References (41)

1. Guo ZX, Wong WK, Leung SYS, Fan JT, Chan SF (2008) Genetic optimization of order scheduling with multiple uncertainties. Expert Syst Appl 35:1788-1801
2. Guo ZX, Wong WK, Leung SYS, Fan JT, Chan SF (2008) A genetic-algorithm- based optimization model for scheduling flexible assembly lines. Int J Adv Manuf Technol 36:156-168 (Pubitemid 351214894)
3. Gao J, He G, Wang Y (2009) A new parallel genetic algorithm for solving multiobjective scheduling problems subjected to special process constraint. Int J Adv Manuf Technol 43:151-160
4. Zhang C, Rao Y, Li P (2008) An effective hybrid genetic algorithm for the job shop scheduling problem. Int J Adv Manuf Technol 39:965-974
5. Naderi B, Khalili M, Tavakkoli-Moghaddam R (2009) A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time. Comput Ind Eng 56(4):1494-1501
6. Sha DY, Lin HH (2009) A multi-objective PSO for job-shop scheduling problems. Expert Syst Appl. doi:10.1016/j. eswa.2009.06.041
7. Xia WJ, Wu ZM (2006) A hybrid particle swarm optimization approach for the job-shop scheduling problem. Int J Adv Manuf Technol 29:360-366
8. Mehdizadeh E, Sadi-Nezhad S, Tavakkoli-Moghaddam R (2008) Optimization of fuzzy clustering criteria by a hybrid PSO and fuzzy c-means clustering algorithm. Iran J Fuzzy Syst 5(3):1-14
9. Eswaramurthy VP, Tamilarasi A (2009) Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems. Int J Adv Manuf Technol 40:1004-1015
10. Wang YM, Xiao NF, Yin HL, Hu EL, Zhao CG, Jiang YR (2008) A two-stage genetic algorithm for large size job shop scheduling problems. Int J Adv Manuf Technol 39:813-820
11. Pan CH, Huang HC (2009) A hybrid genetic algorithm for nowait job shop scheduling problems. Expert Syst Appl 36:5800-5806
12. Roshanaei V, Khaleghei A, Balagh G, Esfahani MMS, Vahdani B (2009) A mixed-integer linear programming model along with an electromagnetism-like algorithm for scheduling job shop production system with sequence-dependent set-up times. Int J Adv Manuf Technol. doi:10.1007/s00170-009-2210-9
13. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and job-shop scheduling. Math Oper Res 1:117-129
14. Serafini P, Ukovich W (1989) A mathematical model for periodic scheduling problems. SIAM J Discrete Math 2(4):550-581
15. Brucker P, Kampmeyer T (2005) Tabu search algorithms for cyclic machine scheduling problems. J Sched 8:303-322 (Pubitemid 40878782)
16. Brucker P, Kampmeyer T (2008) A general model for cyclicmachine scheduling problems. Discrete Appl Math 156:2561-2572
17. Chrétienne P (1991) The basic cyclic scheduling problem with deadlines. Discrete Appl Math 30:109-123
18. Munier A (1996) The basic cyclic scheduling problem with linear precedence constraints. Discrete Appl Math 64:219-238 (Pubitemid 126374590)
19. Kimbrel T, Sviridenko M (2008) High-multiplicity cyclic job shop scheduling. Oper Res Lett 36:574-578
20. Cavory G, Dupas R, Goncalves G (2005) A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints. Eur J Oper Res 161:73-85
21. Song JS, Lee TE (1998) Petri net modeling and scheduling for cyclic job shops with blocking. Comput Ind Eng 34 (2):281-295
22. Tohme H, Nakamura M, Hachiman K, Onaga K (1999) Evolutionary Petri net approach to periodic job-shop scheduling. In: Proc IEEE Int Conf Syst Man Cybern (SMC'99) 12-15 October 1999, Tokyo, Japan, vol. 4:441-446
23. Song JS, Lee TE (1996) A tabu search procedure for periodic job shop scheduling. Comput Ind Eng 30(3):321-577
24. Lee TE, Posner ME (1997) Performance measures and schedules in periodic job shops. Oper Res 45(1):72-91 (Pubitemid 127684688)
25. Liebchen C (2006) Periodic timetable optimization in public transport. PhD Thesis, Technische Universität Berlin
26. Kinder M (2008) Models for periodic timetabling. Master's thesis, Technische Universität Berlin
27. Liebchen C, Peeters L (2002) Some practical aspects of periodic timetabling. In: Cha-moni P, Leisten R, Martin A, Minnemann J, Stadtler H (eds) Operations research proceeding 2001. Springer, Berlin
28. Odijk MA (1994) Construction of periodic timetables. Part I: A cutting plane algorithm. Technical Report, DUT-TWI-94-61, Delft, The Netherlands
29. Nachtigall K (1996) Cutting planes for a polyhedron associated with a periodic network. DLR Interner Bericht, 112-96/17
30. Chang PC, Chen SH, Fan CY (2009) A hybrid electromagnetismlike algorithm for single machine scheduling problem. Expert Syst Appl 36:1259-1267
31. Naderi B, Tavakkoli-Moghaddam R, Khalili M (2009) Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan. Knowl-Based Syst. doi:10.1016/j.knosys.2009.06.002
32. Tavakkoli-Moghaddam R, Khalili M, Naderi B (2009) A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness. Soft Comput 13:995-1006
33. Lin TL, Horng SJ, Kao TW, Chen YH, Run RS, Chen RJ, Lai JL, Kuo IH (2009) An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst Appl. doi:10.1016/j. eswa.2009.08.015
34. Liu B, Wang L, Jin YH (2007) An effective hybrid particle swarm optimization for no-wait flow shop scheduling. Int J Adv Manuf Technol 31:1001-1011 (Pubitemid 46092501)
35. Zhang G, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible jobshop scheduling problem. Comput Ind Eng 56:1309-1318
36. Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proc IEEE International Conference on Neural Networks, IEEE service Center, Piscataway, N.J., 4:1942-1948
37. Braune R, Zapfel G, Affenzeller M (2009) A computational study of lower bounding schemes for total weighted tardiness job shops. In: Proceedings of the 2nd International Symposium on Logistics and Industrial Informatics, LINDI 2009. pp 1-6
38. Hoitomt DJ, Luh PB, Pattipati KR (1993) A practical approach to job-shop scheduling problems. IEEE Trans Robot Automation 9 (1):1-13
39. Lancia G, Rinaldi F, Serafini P (2007) A compact optimization approach for job-shop problems. In: Baptiste P, Kendall G, Munier-Kordon A, Sourd F (eds) Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and applications (MISTA), pp 293-300
40. Singer M, Pinedo M (1998) A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Trans 30(2):109-118 (Pubitemid 128728632)
41. Jamili A, Shafia MA, Tavakkoli-Moghaddam R (2009) A hybridization of simulated annealing and electromagnetism-like mechanism for a periodic job shop scheduling problem. Working paper