Abstract
Many algorithms for minimizing the weighted tardiness in the permutation flowshop problem rely on local search procedures. An increase in the efficiency of evaluating the objective function for neighboring candidate solutions directly also improves the performance of such algorithms. In this paper, we introduce a speed up of the evaluation of the weighted tardiness while exploring the insert neighborhood of a solution. To discard non-improving neighbors and to avoid the full computation of the objective function, we use an approximation of the weighted tardiness. The experimental results show that the technique delivers a consistent speed-up that increases with instance size. Furthermore, we show that it is possible to apply the same approximation technique to the exchange neighborhood achieving again a consistent, but smaller speed-up.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dubois-Lacoste, J., López-Ibáñez, M., Stützle, T.: Effective hybrid stochastic local search algorithms for biobjective permutation flowshop scheduling. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 5818, pp. 100–114. Springer, Heidelberg, Germany (2009)
Marmion, M.E., Mascia, F., López-Ibáñez, M., Stützle, T.: Automatic design of hybrid stochastic local search algorithms. In: Blesa, M.J., Blum, C., Festa, P., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 7919, pp. 144–158. Springer, Heidelberg, Germany (2013)
Mascia, F., López-Ibáñez, M., Dubois-Lacoste, J., Stützle, T.: From grammars to parameters: Automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness. In: Pardalos, P., Nicosia, G. (eds.) Learning and Intelligent Optimization, 7th International Conference, LION 7. Lecture Notes in Computer Science, vol. 7997, pp. 321–334. Springer, Heidelberg, Germany (2013)
Minella, G., Ruiz, R., Ciavotta, M.: A review and evaluation of multiobjective algorithms for the flowshop scheduling problem. INFORMS J. Comput. 20(3), 451–471 (2008)
Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. Eur. J. Oper. Res. 91(1), 160–175 (1996)
Ruiz, R., Maroto, C., Alcaraz, J.: Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34(5), 461–476 (2006)
Taillard, É.D.: Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Oper. Res. 47(1), 65–74 (1990)
Vallada, E., Ruiz, R., Minella, G.: Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics. Comput. Oper. Res. 35(4), 1350–1373 (2008)
Acknowledgments
This research has received support from the COMEX project P7/36 within the Interuniversity Attraction Poles Programme of the Belgian Science Policy Office. Thomas Stützle acknowledges support from the Belgian F.R.S.-FNRS, of which he is a senior research associate.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pagnozzi, F., Stützle, T. Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem. Optim Lett 11, 1283–1292 (2017). https://doi.org/10.1007/s11590-016-1086-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-016-1086-5