Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues

International Transactions in Operational Research

Volumn 21, Issue 1, 2014, Pages 103-126

  Juan, Angel A ^a   Lourenço, Helena R ^b   Mateo, Manuel ^c   Luo, Rachel ^a   Castella, Quim ^a  

^a UNIVERSITAT OBERTA DE CATALUNYA   (Spain)

^b DEPARTMENT OF ECONOMICS AND BUSINESS   (Spain)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Biased randomized heuristics; Flow shop problem; Iterated local search; Metaheuristics; Parallelizable algorithms; Parameters setting; Scheduling

Indexed keywords

FLOW SHOP PROBLEMS; ITERATED LOCAL SEARCH; META HEURISTICS; PARAMETERS SETTING; RANDOMIZED HEURISTICS;

ALGORITHMS; PARALLEL ARCHITECTURES; RANDOM NUMBER GENERATION; RANDOM PROCESSES; SCHEDULING;

PARAMETER ESTIMATION;

EID: 84889683989     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/itor.12028     Document Type: Article

References (52)

1. Alabas-Uslu, C., Dengiz, B., 2011. A self-adaptive local search algorithm for the classical vehicle routing problem. Expert Systems and Applications 38, 8990-8998.
2. Aldowaisan, T., Allahvedi, A., 2003. New heuristics for no-wait flowshops to minimize makespan. Computers and Operations Research 30, 8, 1219-1231.
3. Burke, E., Curtois, T., Hyde, M., Kendall, G., Ochoa, G., Petrovic, S., Vazquez-Rodriguez, J.A., Gendreau, M., 2010. Iterated local search vs. hyper-heuristics: towards general-purpose search algorithms. Proceedings of the IEEE World Congress on Computational Intelligence, IEEE Press, Shangai, China, pp. 1-8.
4. Campbell, H.G., Dudek, R.A., Smith, M.L., 1970. A heuristic algorithm for the n job, m machine sequencing problem. Management Science 16, B630-B637.
5. Chandrasekharan, R., Ziegler, H., 2004. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155, 2, 426-438.
6. Chen, C.L., Vempati, V.S., Aljaber, N., 1995. An application of genetic algorithms for flow shop problems. European Journal of Operational Research 80, 2, 389-396.
7. max problems. Computers & Operations Research 34, 938-953.
8. Cooren, Y., Clerc, M., Siarry, P., 2011. MO-TRIBES: an adaptive multiobjective particle swarm optimization algorithm. Computational Optimization and Applications 49, 2, 379-400.
9. Cordeau, J.F., Gendreau, M., Laporte, G., Potvin, J.Y., Semet, F., 2002. A guide to vehicle routing heuristics. Journal of the Operational Research Society 53, 512-522.
10. Dannenbring, D.G., 1977. An evaluation of flowshop sequence heuristics. Management Science 23, 1174-1182.
11. Engin, O., Ceran, G., Yilmaz, M.K., 2011. An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems. Applied Soft Computing 11, 3056-3065.
12. Feo, T.A., Resende, M.G.C., 1995. Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109-133.
13. Festa, P., Resende, M.G.C., 2009a. An annotated bibliography of GRASP Part I: algorithms. International Transactions in Operational Research 16, 1-24.
14. Festa, P., Resende, M.G.C., 2009b. An annotated bibliography of GRASP Part II: applications. International Transactions in Operational Research 16, 131-172.
15. Framinan, J.M., Gupta, J.N.D., Leisten, R., 2004. A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society 55, 1243-1255.
16. Framinan, J.M., Leisten, R., 2003. An efficient constructive heuristic for flowtime minimisation in permutation flow shops. OMEGA 31, 311-317.
17. Gendreau, M., Potvin, J.Y., 2005. Metaheuristics in combinatorial optimization. Annals of Operations Research 140, 1, 189-213.
18. Hejazi, S.R., Saghafian, S., 2005. Flowshop-scheduling with makespan criterion: a review. International Journal of Production Research 43, 2895-2929.
19. Johnson, S.M., 1954. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1, 61-68.
20. Juan, A., Faulin, J., Jorba, J., Caceres, J., Marques, J., 2011a. Using parallel & distributed computing for solving real-time vehicle routing problems with stochastic demands. Annals of Operations Research, 1-22, doi:10.1007/s10479-011-0918-z.
21. Juan, A., Faulin, J., Jorba, J., Riera, D., Masip, D., Barrios, B., 2011b. On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics. Journal of the Operational Research Society 62, 1085-1097.
22. Juan, A., Faulin, J., Ruiz, R., Barrios, B., Caballe, S., 2010. The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem. Applied Soft Computing 10, 1, 215-224.
23. Kahraman, C., Engin, O., Kaya, I., Ozturk, R.E., 2010. Multiprocessor task scheduling in multistage hybrid flow-shops: a parallel greedy algorithm approach. Applied Soft Computing 10, 1293-1300.
24. Ladhari, T., Haouari, M., 2005. A computational study of the permutation flow shop problem based on a tight lower bound. Computers & Operations Research 32, 1831-1847.
25. L'Ecuyer, P., 2001. Software for uniform random number generation: distinguishing the good and the bad. Proceedings of the 2001 Winter Simulation Conference, IEEE Press, Arlington, VA, pp. 95-105.
26. Lourenço, H.R., Martin, O., Stützle, T., 2010. Iterated local search: framework and applications. In Gendreau, M. and Potvin, J.Y. (eds) Handbook of Metaheuristics, Vol. 146, International Series in Operations Research & Management Science. Kluwer Academic Publishers, Dordrecht, pp. 363-397.
27. Luke, S., 2009. Essentials of Metaheuristics. Lulu, Raleigh, NC.
28. Matsui, S., Yamada, S., 2007. An empirical performance evaluation of a parameter-free genetic algorithm for job-shop scheduling problem. Proceedings of the 2007 IEEE Congress on Evolutionary Computation, IEEE Press, Singapore, pp. 3796-3803.
29. Moccellin, J.V., 1995. A new heuristic method for the permutation flow-shop scheduling problem. Journal of the Operational Research Society 46, 883-886.
30. Nagano, M.S., Ruiz, R., Nogueira, L.A., 2008. A constructive genetic algorithm for permutation flowshop scheduling. Computers & Industrial Engineering 55, 195-207.
31. Nawaz, M., Enscore, E., Ham, I., 1983. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA 11, 91-95.
32. Osman, L., Potts, C., 1989. Simulated annealing for permutation flow-shop scheduling. OMEGA 17, 6, 551-557.
33. Pan, Q.K., Wang, L., Zhao, B.H., 2008. An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. International Journal of Advanced Manufacturing Technology 38, 7-8, 778-786.
34. Prais, M., Ribeiro, C.C., 2000. Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing 12, 164-176.
35. Ravetti, M.G., Nakamura, F.G., Meneses, C.N., Resende, M.G.C., Mateus, G.R., Pardalos, P.M., 2006. Hybrid heuristics for the permutation flow shop problem. AT&T Labs Research Technical Report. TD-6V9MEV, Shannon Laboratory, Florham Park, NJ.
36. Ravetti, M.G., Riveros, C., Mendes, A., Resende, M.G.C., Pardalos, P. 2012. Parallel hybrid heuristics for the permutation flow shop problem. Annals of Operations Research 199, 269-284.
37. Reeves, C.R., 1993. Improving the efficiency of tabu search for machine scheduling problems. Journal of the Operational Research Society 44, 4, 375-382.
38. Reeves, C.R., 1995. A genetic algorithm for flowshop sequencing. Computers and Operations Research 22, 1, 5-13.
39. Resende, M.G.C., Ribeiro, C.C., 2005. GRASP: greedy randomized adaptive search procedures. In Burke, E.K. and Kendall, G. (eds) Search Methodologies, 2nd edn. Springer, New York.
40. Ribas, I., Companys, R., Tort-Martorell, X., 2010. Comparing three-step heuristics for the permutation flow shop problem. Computers & Operations Research 37-12, 2062-2070.
41. Robinson, S., 1997. Simulation model verification and validation: increasing the user's confidence. Proceedings of the 1997 Winter Simulation Conference, IEEE Computer Society, Atlanta, GA, pp. 53-59.
42. Ruiz, R., Maroto, C., 2005. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165, 479-494.
43. Ruiz, R., Maroto, C., Alcaraz, J., 2006. Two new robust genetic algorithms for the flowshop scheduling problem. Omega-International Journal of Management Science 34, 461-476.
44. Ruiz, R., Stützle, T, 2007. A simple and effective iterated greedy algorithm for the permutation flow-shop scheduling problem. European Journal of Operational Research 177, 2033-2049.
45. Stützle, T., 1998. Applying Iterated Local Search to the Permutation Flow Shop Problem. Available at http://iridia.ulb.ac.be/~stuetzle/publications/AIDA-98-04.pdf (accessed June 10, 2013).
46. Suliman, S., 2000. A two-phase heuristic approach to the permutation flow-shop scheduling problem. International Journal of Production Economics 65, 1-3, 143-152.
47. Taillard, E., 1990. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47, 65-74.
48. Taillard, E., 1993. Benchmarks for basic scheduling problems. European Journal of Operations Research 64, 278-285.
49. Talbi, E., 2009. Metaheuristics: From Design to Implementation. John Wiley & Sons, Hoboken, NJ.
50. Widmer, M., Hertz, A., 1989. A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research 41, 2, 186-193.
51. Zheng, T., Yamashiro, M., 2010. Solving flow shop scheduling problems by quantum differential evolutionary algorithm. International Journal of Advanced Manufacturing Technology 49, 643-662.
52. Zobolas, C., Tarantilis, C., Ioannou, G., 2009. Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Computers & Operations Research 36, 1249-1267.