IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v260y2017i2p482-493.html
   My bibliography  Save this article

Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources

Author

Listed:
  • Fanjul-Peyro, Luis
  • Perea, Federico
  • Ruiz, Rubén

Abstract

In this paper we analyze a parallel machine scheduling problem in which the processing of jobs on the machines requires a number of units of a scarce resource. This number depends both on the job and on the machine. The availability of resources is limited and fixed throughout the production horizon. The objective considered is the minimization of the makespan. We model this problem by means of two integer linear programming problems. One of them is based on a model previously proposed in the literature. The other one, which is based on the resemblance to strip packing problems, is an original contribution of this paper. As the models presented are incapable of solving medium-sized instances to optimality, we propose three matheuristic strategies for each of these two models. The algorithms proposed are tested over an extensive computational experience. Results show that the matheuristic strategies significantly outperform the mathematical models.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:260:y:2017:i:2:p:482-493
    DOI: 10.1016/j.ejor.2017.01.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717300073
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2017.01.002?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. 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.
    3. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    4. 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.
    5. E. Mokotoff & J.L. Jimeno, 2002. "Heuristics Based on Partial Enumeration for the Unrelated Parallel Processor Scheduling Problem," Annals of Operations Research, Springer, vol. 117(1), pages 133-150, November.
    6. Kellerer, H. & Strusevich, V. A., 2003. "Scheduling parallel dedicated machines under a single non-shared resource," European Journal of Operational Research, Elsevier, vol. 147(2), pages 345-364, June.
    7. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    8. Edis, Emrah B. & Oguz, Ceyda & Ozkarahan, Irem, 2013. "Parallel machine scheduling with additional resources: Notation, classification, models and solution methods," European Journal of Operational Research, Elsevier, vol. 230(3), pages 449-463.
    9. Billaut, Jean-Charles & Della Croce, Federico & Grosso, Andrea, 2015. "A single machine scheduling problem with two-dimensional vector packing constraints," European Journal of Operational Research, Elsevier, vol. 243(1), pages 75-81.
    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. Fleszar, Krzysztof & Hindi, Khalil S., 2018. "Algorithms for the unrelated parallel machine scheduling problem with a resource constraint," European Journal of Operational Research, Elsevier, vol. 271(3), pages 839-848.
    2. Wolff, Pascal & Emde, Simon & Pfohl, Hans-Christian, 2021. "Internal resource requirements: The better performance metric for truck scheduling?," Omega, Elsevier, vol. 103(C).
    3. Parreño, F. & Alvarez-Valdes, R., 2021. "Mathematical models for a cutting problem in the glass manufacturing industry," Omega, Elsevier, vol. 103(C).
    4. 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).
    5. Norelhouda Sekkal & Fayçal Belkaid, 2020. "A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 660-696, October.
    6. Kennedy A. G. Araújo & Tibérius O. Bonates & Bruno A. Prata & Anselmo R. Pitombeira-Neto, 2021. "Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(3), pages 660-693, October.
    7. Geurtsen, M. & Didden, Jeroen B.H.C. & Adan, J. & Atan, Z. & Adan, I., 2023. "Production, maintenance and resource scheduling: A review," European Journal of Operational Research, Elsevier, vol. 305(2), pages 501-529.
    8. Norelhouda Sekkal & Fayçal Belkaid, 0. "A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-37.
    9. 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.
    10. 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.
    11. Hesham K. Alfares, 2022. "Plant shutdown maintenance workforce team assignment and job scheduling," Journal of Scheduling, Springer, vol. 25(3), pages 321-338, June.
    12. Emine Akyol Ozer & Tugba Sarac, 2019. "MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 94-124, April.
    13. Prahalad Venkateshan & Joseph Szmerekovsky & George Vairaktarakis, 2020. "A cutting plane approach for the multi-machine precedence-constrained scheduling problem," Annals of Operations Research, Springer, vol. 285(1), pages 247-271, February.
    14. Framinan, Jose M. & Perez-Gonzalez, Paz, 2018. "Order scheduling with tardiness objective: Improved approximate solutions," European Journal of Operational Research, Elsevier, vol. 266(3), pages 840-850.
    15. Ali Kordmostafapour & Javad Rezaeian & Iraj Mahdavi & Mahdi Yar Farjad, 2022. "Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1438-1470, December.
    16. 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.
    17. Bruno de Athayde Prata & Levi Ribeiro Abreu & José Ytalo Ferreira Lima, 2021. "Heuristic methods for the single-machine scheduling problem with periodical resource constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 524-546, July.
    18. 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.
    19. Zhang, Zhe & Gong, Xue & Song, Xiaoling & Yin, Yong & Lev, Benjamin & Chen, Jie, 2022. "A column generation-based exact solution method for seru scheduling problems," Omega, Elsevier, vol. 108(C).
    20. Elham Ziar & Mehdi Seifbarghy & Mahdi Bashiri & Benny Tjahjono, 2023. "An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach," Annals of Operations Research, Springer, vol. 322(2), pages 1143-1166, March.
    21. Mohammad Reza Bazargan-Lari & Sharareh Taghipour & Arash Zaretalab & Mani Sharifi, 2022. "Production scheduling optimization for parallel machines subject to physical distancing due to COVID-19 pandemic," Operations Management Research, Springer, vol. 15(1), pages 503-527, June.
    22. Marco Ghirardi & Fabio Salassa, 2022. "A simple and effective algorithm for the maximum happy vertices problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 181-193, April.
    23. 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.
    24. 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.
    25. Bentao Su & Naiming Xie, 2020. "Single workgroup scheduling problem with variable processing personnel," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(2), pages 671-684, June.

    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. 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.
    3. 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.
    4. 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.
    5. Fleszar, Krzysztof & Hindi, Khalil S., 2018. "Algorithms for the unrelated parallel machine scheduling problem with a resource constraint," European Journal of Operational Research, Elsevier, vol. 271(3), pages 839-848.
    6. Geurtsen, M. & Didden, Jeroen B.H.C. & Adan, J. & Atan, Z. & Adan, I., 2023. "Production, maintenance and resource scheduling: A review," European Journal of Operational Research, Elsevier, vol. 305(2), pages 501-529.
    7. 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.
    8. F. Rodriguez & C. Blum & C. García-Martínez & M. Lozano, 2012. "GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times," Annals of Operations Research, Springer, vol. 201(1), pages 383-401, December.
    9. 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.
    10. Fang, Kan & Wang, Shijin & Pinedo, Michael L. & Chen, Lin & Chu, Feng, 2021. "A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions," European Journal of Operational Research, Elsevier, vol. 291(1), pages 128-146.
    11. Heiner Ackermann & Erik Diessel, 2020. "A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 263-288, October.
    12. Giorgi Tadumadze & Simon Emde & Heiko Diefenbach, 2020. "Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 461-497, June.
    13. Mecler, Davi & Abu-Marrul, Victor & Martinelli, Rafael & Hoff, Arild, 2022. "Iterated greedy algorithms for a complex parallel machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 300(2), pages 545-560.
    14. Jun-Ho Lee & Hoon Jang, 2019. "Uniform Parallel Machine Scheduling with Dedicated Machines, Job Splitting and Setup Resources," Sustainability, MDPI, vol. 11(24), pages 1-23, December.
    15. Mohamed Amine Abdeljaoued & Nour El Houda Saadani & Zied Bahroun, 2020. "Heuristic and metaheuristic approaches for parallel machine scheduling under resource constraints," Operational Research, Springer, vol. 20(4), pages 2109-2132, December.
    16. Francisco Trespalacios & Ignacio E. Grossmann, 2017. "Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem," Annals of Operations Research, Springer, vol. 258(2), pages 747-759, November.
    17. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    18. Liu Guiqing & Li Kai & Cheng Bayi, 2015. "Preemptive Scheduling with Controllable Processing Times on Parallel Machines," Journal of Systems Science and Information, De Gruyter, vol. 3(1), pages 68-76, February.
    19. Anshu Ranjan & Pramod Khargonekar & Sartaj Sahni, 2017. "Offline first-fit decreasing height scheduling of power loads," Journal of Scheduling, Springer, vol. 20(5), pages 527-542, October.
    20. 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.

    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:260:y:2017:i:2:p:482-493. 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.