IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v346y2025i3d10.1007_s10479-025-06471-5.html
   My bibliography  Save this article

Scheduling problems on parallel dedicated machines with non-renewable resource

Author

Listed:
  • Baruch Mor

    (Ariel University)

  • Joanna Berlińska

    (Adam Mickiewicz University)

Abstract

We study scheduling problems on parallel dedicated machines and assume that a specific job can only be processed on one specific machine. We concentrate on solving scheduling problems involving convex resource allocation and address three of the most fundamental measures in scheduling theory, i.e., makespan, total load, and total weighted completion time. Firstly, we focus on position-independent workloads, and then we study the setting of general position-dependent workloads, i.e., the workloads are not restricted to be either monotone functions of the job positions or any specific functions. In all problems, we assume a common continuous and non-renewable (limited) resource and adapt known results from scheduling theory to solve the considered problems.

Suggested Citation

  • Baruch Mor & Joanna Berlińska, 2025. "Scheduling problems on parallel dedicated machines with non-renewable resource," Annals of Operations Research, Springer, vol. 346(3), pages 2173-2193, March.
    • Handle: RePEc:spr:annopr:v:346:y:2025:i:3:d:10.1007_s10479-025-06471-5
    DOI: 10.1007/s10479-025-06471-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06471-5
    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/s10479-025-06471-5?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. Baruch Mor, 2022. "Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 79-97, January.
    2. 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.
    3. Oron, Daniel, 2016. "Scheduling controllable processing time jobs with position-dependent workloads," International Journal of Production Economics, Elsevier, vol. 173(C), pages 153-160.
    4. Ameni Azzouz & Meriem Ennigrou & Lamjed Ben Said, 2018. "Scheduling problems under learning effects: classification and cartography," International Journal of Production Research, Taylor & Francis Journals, vol. 56(4), pages 1642-1661, February.
    5. Donghun Lee & Hyeongwon Kang & Dongjin Lee & Jeonwoo Lee & Kwanho Kim, 2023. "Deep Reinforcement Learning-Based Scheduler on Parallel Dedicated Machine Scheduling Problem towards Minimizing Total Tardiness," Sustainability, MDPI, vol. 15(4), pages 1-14, February.
    6. Yi-Chun Wang & Ji-Bo Wang, 2023. "Study on Convex Resource Allocation Scheduling with a Time-Dependent Learning Effect," Mathematics, MDPI, vol. 11(14), pages 1-20, July.
    7. Baruch Mor & Gur Mosheiov, 2024. "Scheduling on parallel dedicated machines with job rejection," International Journal of Production Research, Taylor & Francis Journals, vol. 62(19), pages 6933-6940, October.
    8. Vitaly A. Strusevich & Kabir Rustogi, 2017. "Scheduling with Time-Changing Effects and Rate-Modifying Activities," International Series in Operations Research and Management Science, Springer, number 978-3-319-39574-6, December.
    9. Baruch Mor & Gur Mosheiov, 2018. "A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection," Annals of Operations Research, Springer, vol. 271(2), pages 1079-1085, December.
    10. Shabtay, Dvir & Kaspi, Moshe, 2006. "Parallel machine scheduling with a convex resource consumption function," European Journal of Operational Research, Elsevier, vol. 173(1), pages 92-107, August.
    11. Xinyu Sun & Xin-Na Geng & Ji-Bo Wang & Feng Liu, 2019. "Convex resource allocation scheduling in the no-wait flowshop with common flow allowance and learning effect," International Journal of Production Research, Taylor & Francis Journals, vol. 57(6), pages 1873-1891, March.
    12. 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.
    13. Daniel Oron, 2016. "Scheduling controllable processing time jobs in a deteriorating environment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(3), pages 535-535, March.
    14. Shabtay, Dvir, 2022. "Single-machine scheduling with machine unavailability periods and resource dependent processing times," European Journal of Operational Research, Elsevier, vol. 296(2), pages 423-439.
    15. 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.
    16. Xiaoli Zhao & Jian Xu & Ji-Bo Wang & Lin Li, 2022. "Bicriteria Common Flow Allowance Scheduling with Aging Effect, Convex Resource Allocation, and a Rate-Modifying Activity on a Single Machine," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 39(05), pages 1-21, 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. Heuser, Patricia & Letmathe, Peter & Vossen, Thomas, 2025. "Skill development in the field of scheduling: A structured literature review," European Journal of Operational Research, Elsevier, vol. 321(3), pages 697-716.
    2. Baruch Mor, 2022. "Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 79-97, January.
    3. Zong-Jun Wei & Li-Yan Wang & Lei Zhang & Ji-Bo Wang & Ershen Wang, 2023. "Single-Machine Maintenance Activity Scheduling with Convex Resource Constraints and Learning Effects," Mathematics, MDPI, vol. 11(16), pages 1-21, August.
    4. Matan Atsmony & Baruch Mor & Gur Mosheiov, 2024. "Single machine scheduling with step-learning," Journal of Scheduling, Springer, vol. 27(3), pages 227-237, June.
    5. Derya Deliktaş, 2022. "Self-adaptive memetic algorithms for multi-objective single machine learning-effect scheduling problems with release times," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 748-784, September.
    6. Ming-Hui Li & Dan-Yang Lv & Yuan-Yuan Lu & Ji-Bo Wang, 2024. "Scheduling with Group Technology, Resource Allocation, and Learning Effect Simultaneously," Mathematics, MDPI, vol. 12(7), pages 1-21, March.
    7. Stanisław Gawiejnowicz & Bertrand Miao-Tsong Lin & Gur Mosheiov, 2024. "Dynamic scheduling problems in theory and practice," Journal of Scheduling, Springer, vol. 27(3), pages 225-226, June.
    8. Mosheiov, Gur & Oron, Daniel & Shabtay, Dvir, 2021. "Minimizing total late work on a single machine with generalized due-dates," European Journal of Operational Research, Elsevier, vol. 293(3), pages 837-846.
    9. Phosavanh, Johnson & Oron, Daniel, 2025. "Minimizing the number of late jobs and total late work with step-learning," European Journal of Operational Research, Elsevier, vol. 321(3), pages 734-749.
    10. Baruch Mor & Gur Mosheiov & Dana Shapira, 2020. "Flowshop scheduling with learning effect and job rejection," Journal of Scheduling, Springer, vol. 23(6), pages 631-641, December.
    11. Shabtay, Dvir & Zofi, Moshe, 2018. "Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 198(C), pages 191-200.
    12. Zheng Liu & Ji-Bo Wang, 2024. "Single-Machine Scheduling with Simultaneous Learning Effects and Delivery Times," Mathematics, MDPI, vol. 12(16), pages 1-20, August.
    13. 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.
    14. Xuyin Wang & Weiguo Liu, 2024. "Optimal Different Due-Date Assignment Scheduling with Group Technology and Resource Allocation," Mathematics, MDPI, vol. 12(3), pages 1-17, January.
    15. Shi-Sheng Li & Ren-Xia Chen, 2022. "Minimizing total weighted late work on a single-machine with non-availability intervals," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1330-1355, September.
    16. Heuser, Patricia & Tauer, Björn, 2023. "Single-machine scheduling with product category-based learning and forgetting effects," Omega, Elsevier, vol. 115(C).
    17. 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.
    18. 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.
    19. Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.
    20. Frederik Ferid Ostermeier & Jochen Deuse, 2024. "Modelling forgetting due to intermittent production in mixed-model line scheduling," Flexible Services and Manufacturing Journal, Springer, vol. 36(2), pages 503-532, June.

    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:annopr:v:346:y:2025:i:3:d:10.1007_s10479-025-06471-5. 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.