IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v83y1998i0p115-13610.1023-a1018951828603.html
   My bibliography  Save this article

Heuristic procedures for parallel-machine schedulingproblems with stochastic precedence constraints

Author

Listed:
  • Klaus Neumann
  • Jürgen Zimmermann

Abstract

This paper is concerned with stochastic scheduling problems with several identical parallel machines, where the task durations and precedence constraints are stochastic. The stochastic precedence constraints are given by special GERT networks. At first, basic concepts and results are surveyed for GERT networks and for single-machine and parallel-machine scheduling with GERT network precedence constraints. An example shows where GERT scheduling problems occur in practice. After that, two types of heuristics for identical parallel-machine GERT scheduling problems with objective functions E(C max ), maxE(C),and E(∑ C) are proposed: generalizations of algorithms for corresponding deterministic scheduling problems and so-called priority-rule methods. An empirical analysis shows the best heuristics for each of the objective functions considered. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Klaus Neumann & Jürgen Zimmermann, 1998. "Heuristic procedures for parallel-machine schedulingproblems with stochastic precedence constraints," Annals of Operations Research, Springer, vol. 83(0), pages 115-136, October.
    • Handle: RePEc:spr:annopr:v:83:y:1998:i:0:p:115-136:10.1023/a:1018951828603
    DOI: 10.1023/A:1018951828603
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018951828603
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018951828603?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:83:y:1998:i:0:p:115-136:10.1023/a:1018951828603. 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.