Time complexity of single machine scheduling with stochastic precedence constraints

DOI10.1007/BF01415888MaRDI QIDQ4009793zbMATH OpenOpenAlexFDO

Authors

Publication date 27 September 1992

Published in ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01415888

zbMATH Keywords

GERT networkssingle machine schedulingstochastic precedence relations

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints
• scientific article; zbMATH DE number 4158355
• Heuristic procedures for parallel-machine scheduling problems with stochastic precedence constraints
• Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness
• scientific article; zbMATH DE number 3906216

Cites work

• Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness
• Complexity of Scheduling under Precedence Constraints
• GERT networks and the time-oriented evaluation of projects
• scientific article; zbMATH DE number 3757695 (Why is no real title available?)
• scientific article; zbMATH DE number 3768969 (Why is no real title available?)
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
• Stochastic project networks. Temporal analysis, scheduling and cost minimization

Cited in

(7)

• Heuristic procedures for parallel-machine scheduling problems with stochastic precedence constraints
• The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
• Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints
• scientific article; zbMATH DE number 4158355 (Why is no real title available?)
• Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness
• Un ordonnancement dynamique de tâches stochastiques sur un seul processeur
• Stochastic Machine Scheduling with Precedence Constraints

This page was built for publication: Time complexity of single machine scheduling with stochastic precedence constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009793)