Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness

DOI10.1007/BF01435461zbMath0823.90058OpenAlexW2014844773MaRDI QIDQ4300605

Klaus Neumann, Matthias C. Bücker, Thomas Rubach

Publication date: 15 August 1994

Published in: [https://portal.mardi4nfdi.de/entity/Q4300601 ZOR Zeitschrift f�r Operations Research Mathematical Methods of Opeartions Research] (Search for Journal in Brave)

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

zbMATH Keywords

polynomial algorithmsmaximum expected latenessexpected weighted flow timestochastic single-machine schedulingtree-like GERT precedence constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Related Items (1)

Time complexity of single machine scheduling with stochastic precedence constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• EOR project networks
• Stochastic project networks. Temporal analysis, scheduling and cost minimization
• GERT networks and the time-oriented evaluation of projects
• Recent Developments In Stochastic Activity Networks
• On the temporal analysis of special GERT networks using a modified Markov renewal process
• Time complexity of single machine scheduling with stochastic precedence constraints
• Complexity of Scheduling under Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness