IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v21y2018i3d10.1007_s10951-017-0515-3.html
   My bibliography  Save this article

Improved algorithms for resource allocation under varying capacity

Author

Listed:
  • Venkatesan T. Chakaravarthy

    (IBM Research)

  • Anamitra R. Choudhury

    (IBM Research)

  • Shalmoli Gupta

    (University of Illinois at Urbana-Champaign)

  • Sambudha Roy

    (Linkedin)

  • Yogish Sabharwal

    (IBM Research)

Abstract

We consider the problem of scheduling a set of jobs on a system that offers certain resource, wherein the amount of resource offered varies over time. For each job, the input specifies a set of possible scheduling instances, where each instance is given by starting time, ending time, profit and resource requirement. A feasible solution selects a subset of job instances such that at any timeslot, the total requirement by the chosen instances does not exceed the resource available at that timeslot, and at most one instance is chosen for each job. The above problem falls under the well-studied framework of unsplittable flow problem on line. The generalized notion of scheduling possibilities captures the standard setting concerned with release times and deadlines. We present improved algorithms based on the primal–dual paradigm, where the improvements are in terms of approximation ratio, running time and simplicity.

Suggested Citation

  • Venkatesan T. Chakaravarthy & Anamitra R. Choudhury & Shalmoli Gupta & Sambudha Roy & Yogish Sabharwal, 2018. "Improved algorithms for resource allocation under varying capacity," Journal of Scheduling, Springer, vol. 21(3), pages 313-325, June.
    • Handle: RePEc:spr:jsched:v:21:y:2018:i:3:d:10.1007_s10951-017-0515-3
    DOI: 10.1007/s10951-017-0515-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-017-0515-3
    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/s10951-017-0515-3?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. Piotr Berman & Bhaskar Dasgupta, 2000. "Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling," Journal of Combinatorial Optimization, Springer, vol. 4(3), pages 307-323, September.
    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. Jasper Jong & Marc Uetz, 2020. "The quality of equilibria for set packing and throughput scheduling games," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(1), pages 321-344, March.
    2. Zhi-Long Chen & Nicholas G. Hall, 2008. "Maximum Profit Scheduling," Manufacturing & Service Operations Management, INFORMS, vol. 10(1), pages 84-107, February.
    3. de Weerdt, Mathijs & Baart, Robert & He, Lei, 2021. "Single-machine scheduling with release times, deadlines, setup times, and rejection," European Journal of Operational Research, Elsevier, vol. 291(2), pages 629-639.
    4. Elendner, Thomas, 2003. "Scheduling and combinatorial auctions: Lagrangean relaxation-based bonds for the WJISP," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 570, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:jsched:v:21:y:2018:i:3:d:10.1007_s10951-017-0515-3. 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.