scientific article; zbMATH DE number 4158355

MaRDI QIDQ3486353zbMATH OpenFDO

Authors Klaus Neumann

Publication date 1990

zbMATH Keywords

maximum expected completion timemin- max single-machine schedulingmin-sum problemsstochastic schedulingstochastic tree-like precedence constraints

Mathematics Subject Classification ID

Stochastic processes (60G99) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Time complexity of single machine scheduling with stochastic precedence constraints
• Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness
• Heuristic procedures for parallel-machine scheduling problems with stochastic precedence constraints
• Stochastic single machine scheduling problem with precedence constraints
• Stochastic Machine Scheduling with Precedence Constraints

Cited in

(7)

• Heuristic algorithms for job-shop scheduling problems with stochastic precedence constraints
• Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints
• scientific article; zbMATH DE number 4135697 (Why is no real title available?)
• Stochastic single machine scheduling problem with precedence constraints
• Time complexity of single machine scheduling with stochastic precedence constraints
• Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness
• On Stochastic Scheduling with In-Tree Precedence Constraints

This page was built for publication:

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