IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i14p2431-d861016.html
   My bibliography  Save this article

A Statistical Comparison of Metaheuristics for Unrelated Parallel Machine Scheduling Problems with Setup Times

Author

Listed:
  • Ana Rita Antunes

    (ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal)

  • Marina A. Matos

    (ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal)

  • Ana Maria A. C. Rocha

    (ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal)

  • Lino A. Costa

    (ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal)

  • Leonilde R. Varela

    (ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal)

Abstract

Manufacturing scheduling aims to optimize one or more performance measures by allocating a set of resources to a set of jobs or tasks over a given period of time. It is an area that considers a very important decision-making process for manufacturing and production systems. In this paper, the unrelated parallel machine scheduling problem with machine-dependent and job-sequence-dependent setup times is addressed. This problem involves the scheduling of tasks on unrelated machines with setup times in order to minimize the makespan. The genetic algorithm is used to solve small and large instances of this problem when processing and setup times are balanced (Balanced problems), when processing times are dominant (Dominant P problems), and when setup times are dominant (Dominant S problems). For small instances, most of the values achieved the optimal makespan value, and, when compared to the metaheuristic ant colony optimization (ACOII) algorithm referred to in the literature, it was found that there were no significant differences between the two methods. However, in terms of large instances, there were significant differences between the optimal makespan obtained by the two methods, revealing overall better performance by the genetic algorithm for Dominant S and Dominant P problems.

Suggested Citation

  • Ana Rita Antunes & Marina A. Matos & Ana Maria A. C. Rocha & Lino A. Costa & Leonilde R. Varela, 2022. "A Statistical Comparison of Metaheuristics for Unrelated Parallel Machine Scheduling Problems with Setup Times," Mathematics, MDPI, vol. 10(14), pages 1-19, July.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:14:p:2431-:d:861016
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/14/2431/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/14/2431/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
    2. Tan, Zhiyi & Chen, Yong & Zhang, An, 2011. "Parallel machines scheduling with machine maintenance for minsum criteria," European Journal of Operational Research, Elsevier, vol. 212(2), pages 287-292, July.
    3. Qiang Yang & Xu Guo & Xu-Dong Gao & Dong-Dong Xu & Zhen-Yu Lu, 2022. "Differential Elite Learning Particle Swarm Optimization for Global Numerical Optimization," Mathematics, MDPI, vol. 10(8), pages 1-32, April.
    4. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    5. Jacek Błażewicz & Maciej Machowiak & Jan Węglarz & Mikhail Kovalyov & Denis Trystram, 2004. "Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan," Annals of Operations Research, Springer, vol. 129(1), pages 65-80, July.
    6. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    7. Fanjul-Peyro, Luis & Perea, Federico & Ruiz, Rubén, 2017. "Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources," European Journal of Operational Research, Elsevier, vol. 260(2), pages 482-493.
    8. Gendreau, Michel & Laporte, Gilbert & Guimaraes, Eduardo Morais, 2001. "A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 133(1), pages 183-189, August.
    9. Ghirardi, M. & Potts, C. N., 2005. "Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach," European Journal of Operational Research, Elsevier, vol. 165(2), pages 457-467, September.
    10. Vallada, Eva & Ruiz, Rubén, 2011. "A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 211(3), pages 612-622, June.
    11. Asiye Aydilek & Harun Aydilek & Ali Allahverdi, 2017. "Minimising maximum tardiness in assembly flowshops with setup times," International Journal of Production Research, Taylor & Francis Journals, vol. 55(24), pages 7541-7565, December.
    12. Tang, Lixin & Wang, Xianpeng, 2009. "Simultaneously scheduling multiple turns for steel color-coating production," European Journal of Operational Research, Elsevier, vol. 198(3), pages 715-725, November.
    13. Lei Xu & Qian Wang & Simin Huang, 2015. "Dynamic order acceptance and scheduling problem with sequence-dependent setup time," International Journal of Production Research, Taylor & Francis Journals, vol. 53(19), pages 5797-5808, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yepes-Borrero, Juan C. & Perea, Federico & Ruiz, Rubén & Villa, Fulgencia, 2021. "Bi-objective parallel machine scheduling with additional resources during setups," European Journal of Operational Research, Elsevier, vol. 292(2), pages 443-455.
    2. Fanjul-Peyro, Luis & Perea, Federico & Ruiz, Rubén, 2017. "Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources," European Journal of Operational Research, Elsevier, vol. 260(2), pages 482-493.
    3. Jesús Isaac Vázquez-Serrano & Leopoldo Eduardo Cárdenas-Barrón & Rodrigo E. Peimbert-García, 2021. "Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem," Mathematics, MDPI, vol. 9(22), pages 1-34, November.
    4. Yantong Li & Jean-François Côté & Leandro Callegari-Coelho & Peng Wu, 2022. "Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1048-1069, March.
    5. Yung-Chia Chang & Kuei-Hu Chang & Ching-Ping Zheng, 2022. "Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem Regarding Printed Circuit Boards," Mathematics, MDPI, vol. 10(13), pages 1-21, July.
    6. Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
    7. Roland Braune, 2022. "Packing-based branch-and-bound for discrete malleable task scheduling," Journal of Scheduling, Springer, vol. 25(6), pages 675-704, December.
    8. Ignacio A. Sepúlveda & Maichel M. Aguayo & Rodrigo De la Fuente & Guillermo Latorre-Núñez & Carlos Obreque & Camila Vásquez Orrego, 2024. "Scheduling mobile dental clinics: A heuristic approach considering fairness among school districts," Health Care Management Science, Springer, vol. 27(1), pages 46-71, March.
    9. Perea, Federico & Yepes-Borrero, Juan C. & Menezes, Mozart B.C., 2023. "Acceptance Ordering Scheduling Problem: The impact of an order-portfolio on a make-to-order firm’s profitability," International Journal of Production Economics, Elsevier, vol. 264(C).
    10. Tugba Saraç & Feristah Ozcelik & Mehmet Ertem, 2023. "Unrelated parallel machine scheduling problem with stochastic sequence dependent setup times," Operational Research, Springer, vol. 23(3), pages 1-19, September.
    11. Bentao Su & Naiming Xie & Yingjie Yang, 2021. "Hybrid genetic algorithm based on bin packing strategy for the unrelated parallel workgroup scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 32(4), pages 957-969, April.
    12. Farbod Farhadi & Sina Ansari & Francisco Jara-Moroni, 2023. "Optimization models for patient and technician scheduling in hemodialysis centers," Health Care Management Science, Springer, vol. 26(3), pages 558-582, September.
    13. Fröhlich von Elmbach, Alexander & Scholl, Armin & Walter, Rico, 2019. "Minimizing the maximal ergonomic burden in intra-hospital patient transportation," European Journal of Operational Research, Elsevier, vol. 276(3), pages 840-854.
    14. Zhang, Zhe & Song, Xiaoling & Huang, Huijung & Zhou, Xiaoyang & Yin, Yong, 2022. "Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong’s learning effect," European Journal of Operational Research, Elsevier, vol. 297(3), pages 866-877.
    15. Maximilian Moser & Nysret Musliu & Andrea Schaerf & Felix Winter, 2022. "Exact and metaheuristic approaches for unrelated parallel machine scheduling," Journal of Scheduling, Springer, vol. 25(5), pages 507-534, October.
    16. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    17. J. Adan, 2022. "A hybrid genetic algorithm for parallel machine scheduling with setup times," Journal of Intelligent Manufacturing, Springer, vol. 33(7), pages 2059-2073, October.
    18. Xiuli Wu & Junjian Peng & Xiao Xiao & Shaomin Wu, 2021. "An effective approach for the dual-resource flexible job shop scheduling problem considering loading and unloading," Journal of Intelligent Manufacturing, Springer, vol. 32(3), pages 707-728, March.
    19. Beezão, Andreza Cristina & Cordeau, Jean-François & Laporte, Gilbert & Yanasse, Horacio Hideki, 2017. "Scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 257(3), pages 834-844.
    20. Fanjul-Peyro, Luis & Ruiz, Rubén, 2010. "Iterated greedy local search methods for unrelated parallel machine scheduling," European Journal of Operational Research, Elsevier, vol. 207(1), pages 55-69, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:14:p:2431-:d:861016. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.