A hybrid two-phase encoding particle swarm optimization for total weighted completion time minimization in proportionate flexible flow shop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 58, Issue 1-4, 2012, Pages 339-357

  Shiau, Der Fang ^a   Huang, Yueh Min ^b  

^a FOOYIN UNIVERSITY   (Taiwan)

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Particle swarm optimization; Proportionate flow shop; Tabu search; Total weighted completion time; Two phase encoding

Indexed keywords

ABSOLUTE POSITION; BENCH-MARK PROBLEMS; CANDIDATE LIST; FIXED SEQUENCE; FLEXIBLE FLOW SHOP; FLOW SHOP PROBLEMS; JOB SEQUENCES; POSITION VALUE; PREMATURE CONVERGENCE; PROCESSING TIME; PROPORTIONATE FLOW SHOP; SCHEDULING PROBLEM; SECOND PHASE; SOLUTION QUALITY; TOTAL WEIGHTED COMPLETION TIME;

ALGORITHMS; ENCODING (SYMBOLS); MACHINE SHOP PRACTICE; PARTICLE SWARM OPTIMIZATION (PSO);

TABU SEARCH;

EID: 84855951483     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-011-3378-3     Document Type: Article

References (45)

1. Pinedo ML (2002) Scheduling: theory, algorithms, and systems, 2nd edn. Prentice-Hall, Englewood Cliffs
2. Ruiz R, Vázquez-Rodríguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1-18
3. Linn R, Zhang W (1999) Hybrid flow shop scheduling: a survey. Comput Ind Eng 37:57-61
4. Garey M, Johnson D, Sethi R (1976) The complexity of flow shop and job shop scheduling. Math Oper Res 1:117-129
5. Ow PS (1985) Focused scheduling in proportionate flow shops. Manage Sci 31:852-869
6. Pinedo ML (1985) A note on stochastic shop models in which jobs have the same processing requirements on each machine. Manage Sci 31:840-845
7. Edwin Cheng TC, Shakhlevich N (1999) Proportionate flow shop with controllable processing times. J Sched 2:253-265 (Pubitemid 129633867)
8. Hou S, Hoogeveen H (2003) The three-machine proportionate flow shop problem with unequal machine speeds. Oper Res Lett 31(3) : 225-231
9. Koulamas C, Kyparisis GJ (2009) A note on the proportionate flow shop with a bottleneck machine. Eur J Oper Res 193:644-645
10. Choi BC, Yoon SH, Chung SJ (2007) Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. Eur J Oper Res 176(2) : 964-974
11. Allahverdi A, Savsar M (2001) Stochastic proportionate flowshop scheduling with setups. Comput Ind Eng 39(3) : 357-369 (Pubitemid 32380887)
12. Shakhlevich NV, Hoogeveen H, Pinedo ML (1998) Minimizing total weighted completion time in a proportionate flow shop. J Sched 1:157-168 (Pubitemid 128544885)
13. Choi BC, Yoon SH, Chung SJ (2006) Minimizing the total weighted completion time in a two-machne proportionate flow shop with different machine speeds. Int J Prod Res s 44(4) : 715-728
14. Estevez-Fernandez A, Mosquera MA, Borm P, Hamers H (2008) Proportionate flow shop games. J Sched 11:433-447
15. Huang YM, Shiau DF (2008) Combined column generation and constructive heuristic for a proportionate flexible flow shop scheduling. Int J Adv Manuf Technol 38 (7/8) : 691-704
16. Van den Akker JM, Hoogeveen JA, Van De Velde SL (1999) Parallel machine scheduling by column generation. Oper Res 47:862-872 (Pubitemid 30594275)
17. Chen ZL, Powell WB (1999) Solving parallel machine scheduling problems by column generation. INFORMS J Comput 11(1) : 78-94
18. Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks. pp 1942-1948
19. Salman A, Ahmad I, Al-Madani S (2002) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26:363-371
20. Tseng CT, Liao CJ (2008) A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Int J Prod Res 46(17) : 4655-4670
21. Wang H (2005) Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Syst 22(2) : 78-85 (Pubitemid 43906636)
22. Kuo IH, Horng SJ, Kao TW, Lin TL, Lee CL, Terano T, Pan Y (2009) An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model. Expert Syst Appl 36(3) : 7027-7032
23. Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177:1930-1947 (Pubitemid 44780934)
24. 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
25. Agrawal S, Panigrahi BK, Tiwari MK (2008) Multiobjective particle swarm algorithm with fuzzy clustering for electrical power dispatch. IEEE Trans Evol Comput 12(5) : 529-541
26. Sha DY, Hsu CY (2006) A hybrid particle swarm optimization for job shop scheduling problem. Comput Ind Eng 51:791-808
27. 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
28. Zhang T, Zhang YJ, Zheng QP, Pardalos PM (2011) A hybrid particle swarm optimization and tabu search algorithm for order planning problems of steel factories based on the make-to-stock and make-to-order management architecture. J Ind Manag Optim 56:1309-1318, 7(1) : 31-51
29. Mahmood A (2010) Replicating web contents using a hybrid particle swarm optimization. Inf Process Manage 46:170-179
30. Chuang LY, Yang CH, Yang CH (2009) Tabu search and binary particle swarm optimization for feature selection using microarray data. J Comput Biol 16(12) : 1689-1703
31. Smith WE (1956) Various optimizers for single-stage production. Nav Res Log Quart 3:59-66
32. Glover F, Laguna M (1997) Tabu search. Kluwer, London
33. Barnes JW, Laguna M (1993) Solving the multiple-machine weighted flow time problem using tabu search. IIE Trans 25:121-128
34. Ben-Daya M, Al-Fawzan M (1998) A tabu search approach for the flow shop scheduling problem. Eur J Oper Res 109:88-95 (Pubitemid 128393230)
35. Bilge Ü, Kiraç F, Kurtulan M, Pekgün P (2004) A tabu search algorithm for parallel machine total tardiness problem. Comput Oper Res 31:397-414 (Pubitemid 38092934)
36. Kim CO, Shin HJ (2003) Scheduling jobs on parallel machines: a restricted tabu search approach. Int J Adv Manuf Technol 22:278-287
37. Dorn J, Girsh M, Skele G, Slany W (1996) Comparison of iterative improvement techniques for schedule optimization. Eur J Oper Res 94:349-361 (Pubitemid 126385642)
38. Jain AS, Rangaswamy B, Meeran S (2000) New and "stronger" job-shop neighbourhoods: a focus on the method of Nowicki and Smutnicki (1996). J Heuristics 6:457-480
39. Bean JC (1994) Genetics and random keys for sequencing and optimization. ORSA J Comput 6:154-160
40. Tasgetiren MF, Sevkli M, Ling YC, Gencyilmaz G (2004) Particle swarm optimization algorithm for permutation flowshop sequencing problem. Lect Notes Comput Sci 3172:382-390
41. Niu Q, Zhou T, Wang L (2010) A hybrid particle swarm optimization for parallel machine total tardiness scheduling. Int J Adv Manuf Technol 49:723-739
42. van den Akker M, Hoogeveen H, de Velde S (2002) Combining column generation and lagrangean relaxation to solve a singlemachine common due date problem. INFORMS J Comput 14(1) : 37-51
43. Kennedy J, Eberhart RC, Shi Y (2001) Swarm intelligence. Morgan Kaufmann, San Francisco
44. He S, Wu QH, Wen JY, Saunders JR, Paton RC (2004) A particle swarm optimizer with passive congregation. BioSystems 78:135-147 (Pubitemid 39536138)
45. Shiau DF, Cheng SC, Huang YM (2008) Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm. Expert Syst Appl 34:1133-1143