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

One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

Author

Listed:
  • Hamilton Emmons

    (Cornell University, Ithaca, New York)

Abstract

This paper first considers the problem of sequencing n jobs on one machine to minimize total tardiness. It proves theorems that establish the relative order in which pairs of jobs are processed in an optimal schedule; frequently they permit the jobs to be completely ordered, thus solving the problem without any searching. In particular, corollaries establish more general conditions than are currently recognized under which sequencing in order of nondecreasing processing times and sequencing in order of nondecreasing due dates are optimal. In general, even large problems may be at least partially ordered to the point that very few schedules remain to be searched. These results are then partly extended to the more general criterion of minimizing a sum of identical, convex, nondecreasing functions of job tardiness, and an efficient algorithm is proposed.

Suggested Citation

  • Hamilton Emmons, 1969. "One-Machine Sequencing to Minimize Certain Functions of Job Tardiness," Operations Research, INFORMS, vol. 17(4), pages 701-715, August.
    • Handle: RePEc:inm:oropre:v:17:y:1969:i:4:p:701-715
    DOI: 10.1287/opre.17.4.701
    as

    Download full text from publisher

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

    More about this item

    Statistics

    Access and download statistics

    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:17:y:1969:i:4:p:701-715. 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.