Makespan Minimization on Unrelated Parallel Machines Scheduling Problem with Sequence Dependent Setup Times by a VNS/ACO Hybrid Algorithm

Eduardo Javier Salazar-Hornig | Bio
Universidad de Concepción
Gina Andrea Soto Gavilán | Bio
Universidad de Concepción
Share:

Abstract

This paper proposes a hybrid heuristic that combines Variable Neighborhood Search (VNS) with Ant Colony Optimization (ACO) to solve the scheduling problem of nonrelated parallel machines with sequence dependent setup times in order to minimize the makespan. The Variable Neighborhood Search is proposed to solve the scheduling problem with a descending scheme in a first phase, with an ACO algorithm, which successively reorder the jobs in the machine with the largest makespan in a second phase. An experimental study was performed using test problems from the literature showing that the second phase of the algorithm improves the solution obtained in the first phase. The results obtained are also compared with other methods in the literature proving to be a competitive method.

Downloads

Download data is not yet available.

References

  1. M. Helal, G. Rabadi y A. Al-Salem, “A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times,” International Journal of Operations Research, vol. 3, n.° 3, pp. 182–192, 2006.
  2. G. Rabadi, R. J. Moraga. y A. Al-Salem, “Heuristics for the unrelated parallel machine scheduling problem with setup times”,Journal of Intelligent Manufacturing, vol. 17, n.° 1, pp. 85–97, 2006.
  3. J-P. Arnaout, R. Musa y G. Rabadi, “A Two-stage Ant Colony Optimization Algorithm to Minimize the Makespan on Unrelated Parallel Machines—part II: Enhancements and Experimentations,” Journal of Intelligent Manufacturing, vol. 25, n.° 1, pp. 43–53, 2014.
  4. E. Vallada y R. Ruiz, “A Genetic Algorithm for the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times,” European Journal of Operational Research, vol. 211, n.°3, pp. 612–622, 2011.
  5. K-Ch. Ying, Z-J. Lee y Sh-W. Lin, “Makespan minimization for scheduling unrelated parallel machines with setup times,” Journal of Intelligent Manufacturing, vol 23, n.° 5, pp. 1795–1803, 2012.
  6. J. Behnamian, M. Zandieh y S. F. Ghomi, “Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm,” Expert Systems with Applications, vol. 36, n.° 6, pp. 9637–9644, 2009.
  7. M. Mateo, J. Teghem y D. Tuyttens, “A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs,” International Journal of Production Research, vol 56, n.° 3, pp. 1030–1053, 2018.
  8. Y-I. Kim y H-J. Kim, “Rescheduling of unrelated parallel machines with job-dependent setup times under forecasted machine breakdown,” International Journal of Production Research, Online: junio 2020. https://doi.org/10.1080/00207543.2020.1775910
  9. N. Mladenovic y P. Hansen, “Variable neighborhood search,” Computers & Operations Research, vol. 24, n.° 11, pp. 1097-1100, 1997.
  10. R. Driessel y L. Mönch, “Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times,” Computers & Industrial Engineering, vol. 61, n.° 2, pp. 33–345, 2011.
  11. P. Hansen, N. Mladenovic y J. Moreno, “Búsqueda de entorno variable,” Revista Iberoamericana de Inteligencia Artificial, vol. 7, n.°19, pp. 77–92, 2003.
  12. M. Dorigo, “Optimization, Learning and Natural Algorithms (in Italian).” Ph.D. Thesis, Dipartimento de Elettronica, Politécnico de Milán (Italy),1992.
  13. E. Salazar y C. Avila, “Heurística GRASP para la minimización del makespan en máquinas paralelas no relacionadas con tiempos de preparación dependientes de la secuencia,” Ingeniare – Revista Chilena de Ingeniería, vol. 25, n.°3, pp. 524 - 34. 2017.
  14. T. Peñaloza, “Algoritmo híbrido GRASP/ACO aplicado al problema de minimización de makespan en máquinas paralelas no relacionadas con tiempos de setup dependientes de la secuencia”. Memoria de Título Ingeniería Civil Industrial, Universidad de Concepción (Chile), Julio 2015.
  15. E. Salazar y J. C. Medina, “Minimización del makespan en máquinas paralelas idénticas con tiempos de preparación dependientes de la secuencia utilizando un algoritmo genético,” Ingeniería, Investigación y Tecnología, vol. 14, n.° 1, pp. 43-51, 2013.
  16. O. H. Ibarra y C. E. Kim, “Heuristic algorithms for scheduling independent tasks on nonidentical processors,” Journal of the ACM, vol. 24, n.° 2, pp. 280-289, 1977.
  17. M. Dorigo y L. M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, n.° 1, pp. 53-66, 1997.
  18. J-P. Arnaout, G. Rabadi y R. Musa, “A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times,” Journal of Intelligent Manufacturing, vol.
  19. , n.° 6, pp. 693-701, 2009.
  20. M. Dorigo y T. Stützle, Ant colony optimization, MIT Press, 2004.
  21. E. Salazar, “Programación de Sistemas de Producción con SPS_Optimizer,” Revista ICHIO, vol. 1, n.°2, pp. 33-46, 2010.
How to Cite
Salazar-Hornig, E. J., & Soto Gavilán, G. A. (2021). Makespan Minimization on Unrelated Parallel Machines Scheduling Problem with Sequence Dependent Setup Times by a VNS/ACO Hybrid Algorithm. Revista Ingenierías, 20(38), 171-184. https://doi.org/10.22395/rium.v20n38a11

Send mail to Author


Send Cancel

We are indexed in