Heuristic algorithms for job-shop scheduling problems with stochastic precedence constraints

DOI10.1023/A:1018955319343zbMath0958.90050MaRDI QIDQ1960310

Welf G. Schneider, Klaus Neumann

Publication date: 11 January 2000

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsstochastic schedulingGERT networksjob-shop and flow-shop scheduling

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Stochastic scheduling theory in operations research (90B36)

Related Items (1)

Group shops scheduling with makespan criterion subject to random release dates and processing times

This page was built for publication: Heuristic algorithms for job-shop scheduling problems with stochastic precedence constraints