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

V-Shaped Policies for Scheduling Deteriorating Jobs

Author

Listed:
  • Gur Mosheiov

    (Hebrew University, Jerusalem, Israel and Baruch College of the City University of New York)

Abstract

A set of N jobs has to be processed on a single machine. Jobs have the same basic processing time, but the actual processing time of each job grows linearly with its starting time. A (possibly) different rate of growth is associated with each job. We show that the optimal sequence to minimize flow time is V-shaped: Jobs are arranged in descending order of growth rate if they are placed before the minimal growth rate job, and in ascending order if placed after it. Efficient (0( N log N )) asymptotically optimal heuristics are developed. Their average performance is shown to be extremely good: The average relative error over a set of 20-job problems is on the order of 10 −5 .

Suggested Citation

  • Gur Mosheiov, 1991. "V-Shaped Policies for Scheduling Deteriorating Jobs," Operations Research, INFORMS, vol. 39(6), pages 979-991, December.
  • Handle: RePEc:inm:oropre:v:39:y:1991:i:6:p:979-991
    DOI: 10.1287/opre.39.6.979
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.39.6.979
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.39.6.979?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:39:y:1991:i:6:p:979-991. 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.