Heuristic procedures for parallel-machine schedulingproblems with stochastic precedence constraints

Klaus Neumann and Jürgen Zimmermann

Annals of Operations Research, 1998, vol. 83, issue 0, 115-136

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

Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018951828603 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:83:y:1998:i:0:p:115-136:10.1023/a:1018951828603

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018951828603

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().