IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v25y2022i5d10.1007_s10951-021-00714-6.html
   My bibliography  Save this article

Exact and metaheuristic approaches for unrelated parallel machine scheduling

Author

Listed:
  • Maximilian Moser

    (DBAI, TU Wien)

  • Nysret Musliu

    (DBAI, TU Wien)

  • Andrea Schaerf

    (University of Udine)

  • Felix Winter

    (DBAI, TU Wien)

Abstract

In this paper, we study an important real-life scheduling problem that can be formulated as an unrelated parallel machine scheduling problem with sequence-dependent setup times, due dates, and machine eligibility constraints. The objective is to minimise total tardiness and makespan. We adapt and extend a mathematical model to find optimal solutions for small instances. Additionally, we propose several variants of simulated annealing to solve very large-scale instances as they appear in practice. We utilise several different search neighbourhoods and additionally investigate the use of innovative heuristic move selection strategies. Further, we provide a set of real-life problem instances as well as a random instance generator that we use to generate a large number of test instances. We perform a thorough evaluation of the proposed techniques and analyse their performance. We also apply our metaheuristics to approach a similar problem from the literature. Experimental results show that our methods are able to improve the results produced with state-of-the-art approaches for a large number of instances.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:jsched:v:25:y:2022:i:5:d:10.1007_s10951-021-00714-6
    DOI: 10.1007/s10951-021-00714-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-021-00714-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10951-021-00714-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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. Jianzhong Du & Joseph Y.-T. Leung, 1990. "Minimizing Total Tardiness on One Machine is NP-Hard," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 483-495, August.
    3. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    4. Mojtaba Afzalirad & Masoud Shafipour, 2018. "Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 423-437, February.
    5. 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.
    6. Tony T. Tran & Arthur Araujo & J. Christopher Beck, 2016. "Decomposition Methods for the Parallel Machine Scheduling Problem with Setups," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 83-95, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chun-Lung Chen, 2023. "An Iterated Population-Based Metaheuristic for Order Acceptance and Scheduling in Unrelated Parallel Machines with Several Practical Constraints," Mathematics, MDPI, vol. 11(6), pages 1-14, March.
    2. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.

    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. 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.
    2. 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.
    3. Yanıkoğlu, İhsan & Yavuz, Tonguc, 2022. "Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 301(3), pages 875-895.
    4. 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.
    5. Hongmin Li & Woonghee T. Huh & Matheus C. Sampaio & Naiping Keng, 2021. "Planning Production and Equipment Qualification under High Process Flexibility," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3369-3390, October.
    6. 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.
    7. Shahvari, Omid & Logendran, Rasaratnam, 2016. "Hybrid flow shop batching and scheduling with a bi-criteria objective," International Journal of Production Economics, Elsevier, vol. 179(C), pages 239-258.
    8. Hinder, Oliver & Mason, Andrew J., 2017. "A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 262(2), pages 411-423.
    9. Dirk Briskorn & Konrad Stephan & Nils Boysen, 2022. "Minimizing the makespan on a single machine subject to modular setups," Journal of Scheduling, Springer, vol. 25(1), pages 125-137, February.
    10. Kramer, Arthur & Iori, Manuel & Lacomme, Philippe, 2021. "Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization," European Journal of Operational Research, Elsevier, vol. 289(3), pages 825-840.
    11. Rauchecker, Gerhard & Schryen, Guido, 2019. "An exact branch-and-price algorithm for scheduling rescue units during disaster response," European Journal of Operational Research, Elsevier, vol. 272(1), pages 352-363.
    12. Timo Gschwind & Stefan Irnich & Christian Tilk & Simon Emde, 2020. "Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network," Journal of Scheduling, Springer, vol. 23(3), pages 363-377, June.
    13. 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.
    14. Mohammad Reza Hosseinzadeh & Mehdi Heydari & Mohammad Mahdavi Mazdeh, 2022. "Mathematical modeling and two metaheuristic algorithms for integrated process planning and group scheduling with sequence-dependent setup time," Operational Research, Springer, vol. 22(5), pages 5055-5105, November.
    15. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.
    16. Sheikh, Shaya & Komaki, G.M. & Kayvanfar, Vahid & Teymourian, Ehsan, 2019. "Multi-Stage assembly flow shop with setup time and release time," Operations Research Perspectives, Elsevier, vol. 6(C).
    17. Sioud, A. & Gagné, C., 2018. "Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 264(1), pages 66-73.
    18. Mansouri, S. Afshin & Aktas, Emel & Besikci, Umut, 2016. "Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption," European Journal of Operational Research, Elsevier, vol. 248(3), pages 772-788.
    19. 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.
    20. Ching-Jong Liao & Cheng-Hsiung Lee & Hsing-Tzu Tsai, 2016. "Scheduling with multi-attribute set-up times on unrelated parallel machines," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4839-4853, August.

    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:spr:jsched:v:25:y:2022:i:5:d:10.1007_s10951-021-00714-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.