IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v36y2024i1d10.1007_s10696-023-09483-0.html
   My bibliography  Save this article

Quick dispatching-rules-based solution for the two parallel machines problem under mold constraints

Author

Listed:
  • Mahdi Jemmali

    (Majmaah University
    University of Sousse
    University of Monastir)

  • Abir Ben Hmida

    (University of Monastir)

Abstract

The main focus of this study is on the makespan minimization scheduling problem on two identical parallel machines with mold constraints. The mold constraint in this problem is described as a resource-constrained problem. In industries such as wafer fabrication, two tasks that use the same mold cannot be processed simultaneously on two parallel machines. Because the problem is NP-hard, ten heuristics have been developed and discussed to describe and solve the problem. These heuristics are based on the dispatching rules, the critical mold approach, the clustering method, and the probabilistic method using the randomization procedure. In addition, a new lower bound is proposed. Four classes with a total of 2160 instances are generated to assess the performance of the proposed algorithms. The computational results showed that the proposed lower bound and heuristics outperform those developed in the literature. In addition, the obtained results showed that the optimal solution is reached in 97.6% of the generated instances.

Suggested Citation

  • Mahdi Jemmali & Abir Ben Hmida, 2024. "Quick dispatching-rules-based solution for the two parallel machines problem under mold constraints," Flexible Services and Manufacturing Journal, Springer, vol. 36(1), pages 224-249, March.
    • Handle: RePEc:spr:flsman:v:36:y:2024:i:1:d:10.1007_s10696-023-09483-0
    DOI: 10.1007/s10696-023-09483-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-023-09483-0
    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/s10696-023-09483-0?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. Lee, Young Hoon & Pinedo, Michael, 1997. "Scheduling jobs on parallel machines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 100(3), pages 464-474, August.
    2. 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.
    3. Ravi Sethi, 1977. "On the Complexity of Mean Flow Time Scheduling," Mathematics of Operations Research, INFORMS, vol. 2(4), pages 320-330, November.
    4. Chen, Jeng-Fung & Wu, Tai-Hsi, 2006. "Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints," Omega, Elsevier, vol. 34(1), pages 81-89, January.
    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. 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.
    2. Vallada, Eva & Ruiz, Rubén, 2010. "Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem," Omega, Elsevier, vol. 38(1-2), pages 57-67, February.
    3. 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.
    4. Mujawar, Sachin & Huang, Simin & Nagi, Rakesh, 2012. "Scheduling to minimize stringer utilization for continuous annealing operations," Omega, Elsevier, vol. 40(4), pages 437-444.
    5. Pohl, Maximilian & Kolisch, Rainer & Schiffer, Maximilian, 2021. "Runway scheduling during winter operations," Omega, Elsevier, vol. 102(C).
    6. Xi, Yue & Jang, Jaejin, 2012. "Scheduling jobs on identical parallel machines with unequal future ready time and sequence dependent setup: An experimental study," International Journal of Production Economics, Elsevier, vol. 137(1), pages 1-10.
    7. Michele Ciavotta & Carlo Meloni & Marco Pranzo, 2016. "Speeding up a Rollout algorithm for complex parallel machine scheduling," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4993-5009, August.
    8. Javad Rezaeian & Reza Alizadeh Foroutan & Toraj Mojibi & Yacob Khojasteh, 2023. "Sensitivity Analysis of the Unrelated Parallel Machine Scheduling Problem with Rework Processes and Machine Eligibility Restrictions," SN Operations Research Forum, Springer, vol. 4(3), pages 1-24, September.
    9. Chin-Chia Wu & Xingong Zhang & Danyu Bai & Ameni Azzouz & Wen-Hsiang Wu & Xin-Rong Chen & Win-Chin Lin, 2024. "Sequencing a tri-criteria multiple job classes and customer orders problem on a single machine by using heuristics and simulated annealing method," Operational Research, Springer, vol. 24(1), pages 1-22, March.
    10. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    11. Marko Ɖurasević & Domagoj Jakobović, 2019. "Creating dispatching rules by simple ensemble combination," Journal of Heuristics, Springer, vol. 25(6), pages 959-1013, December.
    12. Sesh Murthy & Rama Akkiraju & Richard Goodwin & Pinar Keskinocak & John Rachlin & Frederick Wu & James Yeh & Robert Fuhrer & Santhosh Kumaran & Alok Aggarwal & Martin Sturzenbecker & Ranga Jayaraman &, 1999. "Cooperative Multiobjective Decision Support for the Paper Industry," Interfaces, INFORMS, vol. 29(5), pages 5-30, October.
    13. Jinwen Ou, 2020. "Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection," Journal of Scheduling, Springer, vol. 23(5), pages 525-538, October.
    14. Dongni Li & Xianwen Meng & Miao Li & Yunna Tian, 2016. "An ACO-based intercell scheduling approach for job shop cells with multiple single processing machines and one batch processing machine," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 283-296, April.
    15. Byung-Cheon Choi & Myoung-Ju Park, 2015. "A Batch Scheduling Problem with Two Agents," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-19, December.
    16. S Afshin Mansouri & Emel Aktas, 2016. "Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(11), pages 1382-1394, November.
    17. Shell Ying Huang & Ya Li, 2017. "Yard crane scheduling to minimize total weighted vessel loading time in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 689-720, December.
    18. Bozorgirad, Mir Abbas & Logendran, Rasaratnam, 2013. "Bi-criteria group scheduling in hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 145(2), pages 599-612.
    19. Biber Nurit & Mor Baruch & Schlissel Yitzhak & Shapira Dana, 2023. "Lot scheduling involving completion time problems on identical parallel machines," Operational Research, Springer, vol. 23(1), pages 1-29, March.
    20. Weng, Wei & Fujimura, Shigeru, 2012. "Control methods for dynamic time-based manufacturing under customized product lead times," European Journal of Operational Research, Elsevier, vol. 218(1), pages 86-96.

    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:flsman:v:36:y:2024:i:1:d:10.1007_s10696-023-09483-0. 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.