IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v32y1984i1p80-88.html
   My bibliography  Save this article

On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals

Author

Listed:
  • Barbara Simons

    (IBM Research, San Jose, California)

  • Michael Sipser

    (Massachusetts Institute of Technology, Cambridge, Massachusetts)

Abstract

We consider the problem of scheduling n unit-time jobs with multiple release time/deadline intervals, which are intervals of time in which the job can be scheduled. A feasible schedule is one in which each job is run in its entirety within one of its release time/deadline intervals. We show that the general problem is NP-complete, but that for a special case one can determine in polynomial time if a feasible schedule exists. If there is a feasible schedule for the special case, then it is possible to obtain both a schedule that minimizes the maximum completion time and also one that minimizes the sum of the completion times of all jobs. If, on the other hand, there is no feasible schedule, then one can determine the minimum number of jobs that must be removed to make the problem instance feasible.

Suggested Citation

  • Barbara Simons & Michael Sipser, 1984. "On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals," Operations Research, INFORMS, vol. 32(1), pages 80-88, February.
    • Handle: RePEc:inm:oropre:v:32:y:1984:i:1:p:80-88
    DOI: 10.1287/opre.32.1.80
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.32.1.80
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.32.1.80?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
    ---><---

    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:inm:oropre:v:32:y:1984:i:1:p:80-88. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.