IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v31y2023i1d10.1007_s10100-022-00803-7.html
   My bibliography  Save this article

On the minimum number of resources for a perfect schedule

Author

Listed:
  • Rachid Benmansour

    (Institut National de Statistique et d’Économie Appliquée)

  • Oliver Braun

    (Trier University of Applied Sciences, Environmental Campus Birkenfeld)

Abstract

In the single-processor scheduling problem with time restrictions there is one main processor and B resources that are used to execute the jobs. A perfect schedule has no idle times or gaps on the main processor and the makespan is therefore equal to the sum of the processing times. In general, more resources result in smaller makespans, and as it is in practical applications often more economic not to mobilize resources that will be unnecessary and expensive, we investigate in this paper the problem to find the smallest number B of resources that make a perfect schedule possible. We show that the decision version of this problem is NP-complete, derive new structural properties of perfect schedules, and we describe a Mixed Integer Linear Programming (MIP) formulation to solve the problem. A large number of computational tests show that (for our randomly chosen problem instances) only $$B=3$$ B = 3 or $$B=4$$ B = 4 resources are sufficient for a perfect schedule.

Suggested Citation

  • Rachid Benmansour & Oliver Braun, 2023. "On the minimum number of resources for a perfect schedule," 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. 31(1), pages 191-204, March.
    • Handle: RePEc:spr:cejnor:v:31:y:2023:i:1:d:10.1007_s10100-022-00803-7
    DOI: 10.1007/s10100-022-00803-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-022-00803-7
    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/s10100-022-00803-7?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. Kabir Rustogi & Vitaly A. Strusevich, 2013. "Parallel Machine Scheduling: Impact of Adding Extra Machines," Operations Research, INFORMS, vol. 61(5), pages 1243-1257, October.
    2. Oliver Braun & Fan Chung & Ron Graham, 2016. "Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 531-540, March.
    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. Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
    2. Rainer Kolisch & Erik Demeulemeester & Rubén Ruiz Garcia & Vincent T’Kindt & Jan Węglarz, 2016. "Editorial “Project Management and Scheduling”," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 279-281, March.
    3. Rachid Benmansour & Oliver Braun & Saïd Hanafi, 2019. "The single-processor scheduling problem with time restrictions: complexity and related problems," Journal of Scheduling, Springer, vol. 22(4), pages 465-471, August.
    4. Alan J. Soper & Vitaly A. Strusevich, 2022. "Preemptive and non-preemptive scheduling on two unrelated parallel machines," Journal of Scheduling, Springer, vol. 25(6), pages 659-674, December.
    5. Alan J. Soper & Vitaly A. Strusevich, 2021. "Parametric analysis of the quality of single preemption schedules on three uniform parallel machines," Annals of Operations Research, Springer, vol. 298(1), pages 469-495, March.
    6. Halman, Nir & Kellerer, Hans & Strusevich, Vitaly A., 2018. "Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints," European Journal of Operational Research, Elsevier, vol. 270(2), pages 435-447.

    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:cejnor:v:31:y:2023:i:1:d:10.1007_s10100-022-00803-7. 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.