IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v29y1983i3p384-388.html
   My bibliography  Save this article

Note---On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem

Author

Listed:
  • Hiroshi Kise

    (Kyoto Institute of Technology)

  • Toshihide Ibaraki

    (Kyoto University)

Abstract

In 1973, Balut gave an algorithm to solve an n-job one machine scheduling problem in which processing times are random variables and the objective is to minimize the number of tardy jobs with a specified certainty level. This note, however, presents an example for which his algorithm fails to give an optimal schedule. Furthermore, there does not seem to exist any such efficient algorithm because the problem can be shown to be NP-complete.

Suggested Citation

  • Hiroshi Kise & Toshihide Ibaraki, 1983. "Note---On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem," Management Science, INFORMS, vol. 29(3), pages 384-388, March.
    • Handle: RePEc:inm:ormnsc:v:29:y:1983:i:3:p:384-388
    DOI: 10.1287/mnsc.29.3.384
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.29.3.384
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.29.3.384?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. Xiaoqiang Cai & Sean Zhou, 1999. "Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs," Operations Research, INFORMS, vol. 47(3), pages 422-437, June.
    2. Sam Ransbotham & Ishwar Murthy & Sabyasachi Mitra & Sridhar Narasimhan, 2011. "Sequential Grid Computing: Models and Computational Experiments," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 174-188, May.

    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:ormnsc:v:29:y:1983:i:3:p:384-388. 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.