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

Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem

Author

Listed:
  • S. S. Panwalkar

    (Texas Tech University, Lubbock, Texas)

  • M. L. Smith

    (Texas Tech University, Lubbock, Texas)

  • A. Seidmann

    (Tel Aviv University, Tel Aviv, Israel)

Abstract

We consider an n job, one machine scheduling problem in which all jobs have a common due date. The objective is to determine the optimal value of this due date and an optimal sequence to minimize a total penalty function. This penalty function is based on the due date value and on the earliness or the lateness of each job in the selected sequence. We present a polynomial bound scheduling algorithm for the solution of this problem along with the proof of optimality, a numerical example and discuss some extensions.

Suggested Citation

  • S. S. Panwalkar & M. L. Smith & A. Seidmann, 1982. "Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem," Operations Research, INFORMS, vol. 30(2), pages 391-399, April.
    • Handle: RePEc:inm:oropre:v:30:y:1982:i:2:p:391-399
    DOI: 10.1287/opre.30.2.391
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.30.2.391
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.30.2.391?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:30:y:1982:i:2:p:391-399. 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.