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

Single Machine Scheduling to Minimize Total Late Work

Author

Listed:
  • C. N. Potts

    (University of Southampton, Southampton, United Kingdom)

  • L. N. Van Wassenhove

    (INSEAD, Fontainebleau, France)

Abstract

In the problem of scheduling a single machine to minimize total late work, there are n jobs to be processed for which each has an integer processing time and a due date. The objective is to minimize the total late work, where the late work for a job is the amount of processing of this job that is performed after its due date. For the preemptive total late work problem, an O ( n log n ) algorithm is derived. The nonpreemptive total late work problem is shown to be NP-hard, although efficient algorithms are derived for the special cases in which all processing times are equal and all due dates are equal. A pseudopolynomial dynamic programming algorithm is presented for the general nonpreemptive total late work problem; it requires O ( n UB) time, where UB is any upper bound on the total late work. Computational results for problems with up to 10,000 jobs are given.

Suggested Citation

  • C. N. Potts & L. N. Van Wassenhove, 1992. "Single Machine Scheduling to Minimize Total Late Work," Operations Research, INFORMS, vol. 40(3), pages 586-595, June.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:3:p:586-595
    DOI: 10.1287/opre.40.3.586
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.3.586
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.3.586?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:40:y:1992:i:3:p:586-595. 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.