Iterated local search heuristics for minimizing total completion time in permutation and non-permutation flow shops

Proceedings International Conference on Automated Planning and Scheduling, ICAPS

Volumn 2015-January, Issue , 2015, Pages 34-41

  Benavides, Alexander J ^a   Ritt, Marcus ^a  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); MACHINE SHOP PRACTICE; SCHEDULING;

BUFFER SIZES; COMPUTATIONAL EXPERIMENT; ITERATED LOCAL SEARCH; PERMUTATION FLOW SHOPS; PERMUTATION SCHEDULES; SECOND PHASE; TOTAL COMPLETION TIME; YIELD STATE;

MACHINE SHOPS;

EID: 84943270752     PISSN: 23340835     EISSN: 23340843     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Balaprakash, P.; Birattari, M.; and Stützle, T. 2007. Improvement strategies for the F-race algorithm: Sampling design and iterative refinement. In Bartz-Beielstein, T; Blesa, M. J.; Blum, C; Naujoks, B.; Roli, A.; Rudolph, G.; and Sampels, M., eds., HM 2007, volume 4771 of LNCS, 108-122.
2. Conway, R. W.; Maxwell, W. L.; and Miller, L. W. 1967. Theory of scheduling. Addison-Wesley.
3. Dong, X.; Chen, P.; Huang, H.; and Nowak, M. 2013. A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time. Comput. Oper. Res. 40:627-632.
4. Duan, J.; Yang, Y; Gao, K.; Li, J.; and Pan, Q. 2013. A speed-up method for calculating total flowtime in permutation flow shop scheduling problem. In 25th Chinese Control and Decision Conference (CCDC), 2755-2758.
5. Dubois-Lacoste, J.; López-Ibânez, M.; and Stutzle, T. 2010. A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems. Technical Report TR/IRIDIA/2010-019, IRIDIA, Université libre de Bruxelles.
6. Garey, M. R.; Johnson, D. S.; and Sethi, R. 1976. The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2):117-129.
7. Gonzalez, T., and Sahni, S. 1978. Flowshop and jobshop schedules: complexity and approximation. Oper. Res. 26:36-52.
8. Graham, R. L.; Lawler, E. L.; Lenstra, J. K.; and Kan, A. H. G. R. 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5:287-326.
9. Jarboui, B.; Eddaly, M.; and Siarry, P. 2009. An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput. Oper. Res. 2638-2646.
10. Krone, M. J., and Steiglitz, K. 1974. Heuristic-programming solution of a flowshop-scheduling problem. Oper. Res. 22(3):629-638.
11. Liao, C. J.; Liao, L. M.; and Tseng, C. T. 2006. A performance evaluation of permutation vs. non-permutation schedules in a flowshop. Int. J. Prod. Res. 44(20):4297-4309.
12. i scheduling problem. Eur. J. Oper. Res. 132:439-452.
13. López-Ibáñez, M.; Dubois-Lacoste, J.; Stutzle, T.; and Birattari, M. 2011. The irace package, iterated race for automatic algorithm configuration. Technical Report TR/IRIDIA/2011-004, IRIDIA, Université libre de Bruxelles.
14. Nagarajan, V., and Sviridenko, M. 2009. Tight bounds for permutation flow shop scheduling. Math. Oper. Res. 34(2):417-427.
15. Osman, I., and Potts, C. 1989. Simulated annealing for permutation flow shop scheduling. Omega 17(6):551-557.
16. Pan, Q.-K., and Ruiz, R. 2012. Local search methods for the flowshop scheduling problem with flowtime minimization. Eur. J. Oper. Res. 222:31-43.
17. Pan, Q.-K., and Ruiz, R. 2013. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Comput. Oper. Res. 40:117-128.
18. Pan, Q.-K.; Tasgetiren, M. F.; and Liang, Y.-C. 2008. A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput. Ind. Eng. 55(4):795-816.
19. Pugazhendhi, S.; Thiagarajan, S.; Rajendran, C; and Anantharaman, N. 2004. Relative performance evaluation of permutation and non-permutation schedules in flowline-based manufacturing system with flowtime objective. Int. J. Adv. Manuf. Technol. 23:820-830.
20. Rajendran, C, and Ziegler, H. 2004. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur. J. Oper. Res. 155(2):426-438.
21. Reeves, C. R. 1995. A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22(1):5-13.
22. Rinnooy Kan, A. H. G. 1976. Machine scheduling problems - Classification, complexity and computations. Martinus Nijhoff.
23. Taillard, E. 1993. Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2):278-285.
24. Tasgetiren, M.; Liang, Y; Sevkli, M; and 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(3):1930-1947.
25. Tasgetiren, M. F.; Pan, Q.-K.; Suganthan, P. N.; and Chen, A. H.-L. 2011. A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Inf. Sci. 181:3459-3475.
26. Tseng, L.-Y, and Lin, Y.-T. 2009. A hybrid genetic local search for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 198(1):84-92.
27. Tseng, L.-Y, and Lin, Y.-T. 2010. A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem. Int. J. Prod. Econ. 127(1):121-128.
28. Xu, X.; Xu, Z.; and Gu, X. 2011. An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization. Exp. Syst. Appl. 38(7):7970-7979.
29. Zhang, Y, and Li, X. 2011. Estimation of distribution algorithm for permutation flow shops with total flowtime minimization. Comput. Ind. Eng. 60(4):706-718.
30. Zhang, L., and Wu, J. 2014. A PSO-based hybrid metaheuristic for permutation flowshop scheduling problems. The Scientific World Journal.
31. Zhang, Y; Li, X.; and Wang, Q. 2009. Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization. Eur. J. Oper. Res. 196:869-876.