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

Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines

Author

Listed:
  • Uttarayan Bagchi

    (The University of Texas at Austin, Texas)

  • Reza H. Ahmadi

    (The University of Texas at Austin, Texas)

Abstract

We consider the NP-hard, one-machine scheduling problem whose objective is to minimize the weighted sum of completion times, subject to meeting deadlines. We propose a new lower bound that dominates the bounds found in the literature.

Suggested Citation

  • Uttarayan Bagchi & Reza H. Ahmadi, 1987. "Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines," Operations Research, INFORMS, vol. 35(2), pages 311-313, April.
    • Handle: RePEc:inm:oropre:v:35:y:1987:i:2:p:311-313
    DOI: 10.1287/opre.35.2.311
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.35.2.311
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.35.2.311?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. Guner, Ertan & Erol, Serpil & Tani, Kazuo, 1998. "One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 55(2), pages 213-219, July.

    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:35:y:1987:i:2:p:311-313. 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.