IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v92y1999i0p45-6310.1023-a1018955319343.html
   My bibliography  Save this article

Heuristic algorithms for job‐shop scheduling problemswith stochastic precedence constraints

Author

Listed:
  • K. Neumann
  • W.G. Schneider

Abstract

This paper deals with job‐shop scheduling with stochastic precedenceconstraints given by so‐called OR networks. At first, a job‐shop problem withstochastic OR network precedence constraints is described, where the expected makespan isto be minimized. Next, the concept of an aggregate schedule is discussed, which represents a deterministic staticscheduling policy for our stochastic problem. The construction of an appropriate aggregatedisjunctive graph permits us to adapt the shifting bottleneck heuristic. After that,a priority‐rulemethod is proposed for finding an approximate aggregate schedule. An experimentalperformance analysis shows that both heuristics provide good approximate solutions. Finally,we briefly discuss a flow‐shop problem with OR network precedence constraints and thecase of cyclic OR networks. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • K. Neumann & W.G. Schneider, 1999. "Heuristic algorithms for job‐shop scheduling problemswith stochastic precedence constraints," Annals of Operations Research, Springer, vol. 92(0), pages 45-63, January.
    • Handle: RePEc:spr:annopr:v:92:y:1999:i:0:p:45-63:10.1023/a:1018955319343
    DOI: 10.1023/A:1018955319343
    as

    Download full text from publisher

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

    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:spr:annopr:v:92:y:1999:i:0:p:45-63:10.1023/a:1018955319343. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.