IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v46y2014i6p619-622.html
   My bibliography  Save this article

A note on the scheduling problem with revised delivery times and job-dependent tardiness penalties

Author

Listed:
  • Christos Koulamas

Abstract

This article considers the single-machine scheduling problem with revised delivery times and job-dependent tardiness penalties. It is shown that the exact dynamic programming algorithm for the simpler problem with job-independent tardiness penalties can be extended to the problem with job-dependent tardiness penalties. When the job-dependent tardiness penalties are bounded by a polynomial function of the number of jobs, the dynamic programming algorithm can be converted to a Fully Polynomial Time Approximation Scheme by implementing the “scaling the input” technique.

Suggested Citation

  • Christos Koulamas, 2014. "A note on the scheduling problem with revised delivery times and job-dependent tardiness penalties," IISE Transactions, Taylor & Francis Journals, vol. 46(6), pages 619-622, June.
    • Handle: RePEc:taf:uiiexx:v:46:y:2014:i:6:p:619-622
    DOI: 10.1080/0740817X.2013.851435
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2013.851435
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2013.851435?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Christos Koulamas & George Steiner, 2021. "New results for scheduling to minimize tardiness on one machine with rejection and related problems," Journal of Scheduling, Springer, vol. 24(1), pages 27-34, February.
    2. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.

    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:taf:uiiexx:v:46:y:2014:i:6:p:619-622. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.