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

Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties

Author

Listed:
  • Sankaran Lakshminarayan

    (University of Quebec, Trois-Rivieres, Quebec)

  • Ram Lakshmanan

    (University of Quebec, Trois-Rivieres, Quebec)

  • Robert L. Papineau

    (University of Quebec, Trois-Rivieres, Quebec)

  • Rene Rochette

    (University of Quebec, Trois-Rivieres, Quebec)

Abstract

We consider a single-machine scheduling problem where penalties occur for jobs that either commence before their target start date or are completed after their due date. The objective is to minimize the maximum penalty subject to certain assumptions on the target start times, due dates, and penalty functions. A more efficient algorithm than the existing one is presented for this problem. The number of computations in the proposed algorithm is of the order of n log n , while in the existing algorithm it is of the order of n 2 .

Suggested Citation

  • Sankaran Lakshminarayan & Ram Lakshmanan & Robert L. Papineau & Rene Rochette, 1978. "Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties," Operations Research, INFORMS, vol. 26(6), pages 1079-1082, December.
    • Handle: RePEc:inm:oropre:v:26:y:1978:i:6:p:1079-1082
    DOI: 10.1287/opre.26.6.1079
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Michael C. Ferris & Milan Vlach, 1992. "Scheduling with earliness and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 229-245, March.
    2. G A Álvarez-Pérez & J L González-Velarde & J W Fowler, 2009. "Crossdocking— Just in Time scheduling: an alternative solution approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 554-564, April.
    3. John J. Kanet & V. Sridharan, 2000. "Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review," Operations Research, INFORMS, vol. 48(1), pages 99-110, February.
    4. Joseph Y.‐T. Leung, 2002. "A dual criteria sequencing problem with earliness and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(4), pages 422-431, June.
    5. Uttarayan Bagchi & Yih‐Long Chang & Robert S. Sullivan, 1987. "Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 739-751, October.
    6. Chung‐Lun Li & T. C. E. Cheng, 1994. "The parallel machine min‐max weighted absolute lateness scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(1), pages 33-46, February.
    7. Awi Federgruen & Gur Mosheiov, 1997. "Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 287-299, April.
    8. Missaoui, Ahmed & Ruiz, Rubén, 2022. "A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows," European Journal of Operational Research, Elsevier, vol. 303(1), pages 99-113.
    9. Yeong‐Dae Kim & Candace Arai Yano, 1994. "Minimizing mean tardiness and earliness in single‐machine scheduling problems with unequal due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(7), pages 913-933, December.
    10. Candace Arai Yano, 1987. "Stochastic leadtimes in two‐level distribution‐type networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(6), pages 831-843, December.

    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:26:y:1978:i:6:p:1079-1082. 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.