Heuristic algorithms for job‐shop scheduling problemswith stochastic precedence constraints

K. Neumann and W.G. Schneider

Annals of Operations Research, 1999, vol. 92, issue 0, 45-63

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

Date: 1999
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018955319343 (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:92:y:1999:i:0:p:45-63:10.1023/a:1018955319343

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

DOI: 10.1023/A:1018955319343

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 ().