IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v328y2026i1p15-31.html

A reduction approach for the parallel machine scheduling problem with a separate server for loading and unloading operations

Author

Listed:
  • Elidrissi, Abdelhak
  • Gupta, Jatinder N.D.
  • Benmansour, Rachid
  • Lin, Bertrand M.T.

Abstract

This paper addresses the non-preemptive identical parallel machine scheduling problem with a dedicated loading server and a dedicated unloading server. Each job has to be loaded by the dedicated loading server immediately before being processed on one of the identical parallel machines, and unloaded immediately by the dedicated unloading server after its processing. The objective function involves the minimization of the makespan. This problem arises in the semiconductor industry, plastic injection industry, kitchen production systems, healthcare, container terminals, and many other industrial fields. We prove the problem to be strongly NP-hard, analyze a special case with identical loading, processing, and unloading times, and establish a tight lower bound. In addition, we propose two novel mixed-integer linear programming formulations: one utilizing time-indexed variables with an iterative strengthening algorithm, and the other employing linear-ordering variables along with two enhanced valid inequalities. Given the complexity of the problem, we introduce a reduction approach that simplifies the problem by modifying certain constraints, enabling the determination of a feasible solution much more quickly. Building on this reduction, we provide a linear-time reduction algorithm and a fast formulation based on assignment-and-positional date variables. Furthermore, we study a special case involving regular jobs. To solve large-scale instances of the problem with up to 250 jobs and up to 5 machines, we design a hybrid approach combining an iterated greedy algorithm with variable neighborhood descent. As shown in the computational experiments on two sets of benchmark instances, the reduction approach significantly outperforms all previous methods existing in the literature.

Suggested Citation

  • Elidrissi, Abdelhak & Gupta, Jatinder N.D. & Benmansour, Rachid & Lin, Bertrand M.T., 2026. "A reduction approach for the parallel machine scheduling problem with a separate server for loading and unloading operations," European Journal of Operational Research, Elsevier, vol. 328(1), pages 15-31.
    • Handle: RePEc:eee:ejores:v:328:y:2026:i:1:p:15-31
    DOI: 10.1016/j.ejor.2025.05.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172500414X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.05.030?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

    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. DYER, Martin E. & WOLSEY, Laurence A., 1990. "Formulating the single machine sequencing problem with release dates as a mixed integer program," LIDAM Reprints CORE 878, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. T.C.E. Cheng & Svetlana A. Kravchenko & Bertrand M. T. Lin, 2019. "Server scheduling on parallel dedicated machines with fixed job sequences," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(4), pages 321-332, June.
    4. Yiwei Jiang & Huijuan Wang & Ping Zhou, 2014. "An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(05), pages 1-11.
    5. Ruiz, Ruben & Stutzle, Thomas, 2008. "An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1143-1159, June.
    6. Hanane Krim & Nicolas Zufferey & Jean-Yves Potvin & Rachid Benmansour & David Duvivier, 2022. "Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times," Journal of Scheduling, Springer, vol. 25(1), pages 89-105, February.
    7. Yiwei Jiang & Qinghui Zhang & Jueliang Hu & Jianming Dong & Min Ji, 2015. "Single-server parallel-machine scheduling with loading and unloading times," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 201-213, August.
    8. Blazewicz, Jacek & Dror, Moshe & Weglarz, Jan, 1991. "Mathematical programming formulations for machine scheduling: A survey," European Journal of Operational Research, Elsevier, vol. 51(3), pages 283-300, April.
    9. T.C.E. Cheng & Svetlana A. Kravchenko & Bertrand M.T. Lin, 2017. "Preemptive parallel‐machine scheduling with a common server to minimize makespan," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(5), pages 388-398, August.
    10. Ruiz, Ruben & Stutzle, Thomas, 2007. "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2033-2049, March.
    11. J. M. van den Akker & J. A. Hoogeveen & S. L. van de Velde, 1999. "Parallel Machine Scheduling by Column Generation," Operations Research, INFORMS, vol. 47(6), pages 862-872, December.
    12. T. C. E. Cheng & Svetlana A. Kravchenko & Bertrand M. T. Lin, 2021. "Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(10), pages 2286-2289, October.
    13. WOLSEY, Laurence A., 1977. "Valid inequalities, covering problems and discrete dynamic programs," LIDAM Reprints CORE 302, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. E. DYER, Martin & WOLSEY, Laurence A., 1990. "Formulating the single machine sequencing problem with release dates as a mixed integer program," LIDAM Reprints CORE 917, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    15. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    16. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    17. 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.
    18. Bish, Ebru K., 2003. "A multiple-crane-constrained scheduling problem in a container terminal," European Journal of Operational Research, Elsevier, vol. 144(1), pages 83-107, January.
    19. Xueling Zhong & Zhangming Pan & Dakui Jiang, 2017. "Scheduling with release times and rejection on two parallel machines," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 934-944, April.
    20. Abdelhak Elidrissi & Rachid Benmansour & Mohammed Benbrahim & David Duvivier, 2021. "Mathematical formulations for the parallel machine scheduling problem with a single server," International Journal of Production Research, Taylor & Francis Journals, vol. 59(20), pages 6166-6184, 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. Abdelhak Elidrissi & Rachid Benmansour & Nicolas Zufferey & Mohammed Benbrahim & David Duvivier, 2024. "Minimization of maximum lateness on parallel machines with a single server and job release dates," 4OR, Springer, vol. 22(3), pages 351-385, September.
    2. Hatami, Sara & Ruiz, Rubén & Andrés-Romano, Carlos, 2015. "Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times," International Journal of Production Economics, Elsevier, vol. 169(C), pages 76-88.
    3. 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.
    4. Ying, Kuo-Ching & Pourhejazy, Pourya & Lin, Zhi-Rong, 2025. "Scheduling with sequence-dependent setup times in short-term production planning: A main path analysis-based review," Operations Research Perspectives, Elsevier, vol. 14(C).
    5. Missaoui, Ahmed & Ruiz, Rubén, 2022. "A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows," European Journal of Operational Research, Elsevier, vol. 303(1), pages 99-113.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    11. 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).
    12. 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.
    13. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.
    14. Agnetis, Alessandro & Billaut, Jean-Charles & Pinedo, Michael & Shabtay, Dvir, 2025. "Fifty years of research in scheduling — Theory and applications," European Journal of Operational Research, Elsevier, vol. 327(2), pages 367-393.
    15. Jan-Niklas Buckow & Marc Goerigk & Sigrid Knust, 2025. "Integrated pallet retrieval and processing in warehouses under uncertainty," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 47(3), pages 817-855, September.
    16. 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.
    17. 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.
    18. 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.
    19. Felix Winter & Nysret Musliu, 2022. "A large neighborhood search approach for the paint shop scheduling problem," Journal of Scheduling, Springer, vol. 25(4), pages 453-475, August.
    20. Stéphane Dauzère-Pérès & Sigrid Lise Nonås, 2023. "An improved decision support model for scheduling production in an engineer-to-order manufacturer," 4OR, Springer, vol. 21(2), pages 247-300, June.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:ejores:v:328:y:2026:i:1:p:15-31. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.