Scheduling under uncertainty: Bounding the makespan distribution

DOI10.1007/3-540-45506-X_7MaRDI QIDQ4542179zbMATH OpenFDO

Authors Rolf H. Möhring

Publication date 4 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://depositonce.tu-berlin.de/handle/11303/15950

zbMATH Keywords

chain-minor of a networkproject schedulingrandom processing timestochastic scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic scheduling theory in operations research (90B36)

Review text

This paper investigates and reviews techniques for taking into account randomness in project scheduling. Particularly the makespan, i.e., the earliest project completion is of interest. Because of the high complexity of the problem, it is unlikely that it can be solved exactly, therefore, approximations or bounds are offered in literature. General bounds and more specific bounds are introduced and analyzed. Some computational experiences with various bounds conclude the paper. For the entire collection see [Zbl 0978.00022].

Recommendations

• Scheduling under uncertainty: Optimizing against a randomizing adversary
• Evaluating project completion time in project networks with discrete random activity durations
• Project scheduling under uncertainty: survey and research potentials
• Note sur les problèmes d'ordonnancement PERT aléatoires
• A computational study on bounding the makespan distribution in stochastic project networks

Cited in

(17)

• Evaluating project completion time in project networks with discrete random activity durations
• A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming
• Exploiting partial correlations in distributionally robust optimization
• Estimating the probability of meeting a deadline in schedules and plans
• Project planning with alternative technologies in uncertain environments
• Scheduling under uncertainty: Optimizing against a randomizing adversary
• Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project
• scientific article; zbMATH DE number 5125607 (Why is no real title available?)
• scientific article; zbMATH DE number 2073567 (Why is no real title available?)
• Bounds on Expected Project Tardiness
• Stochastic limit laws for schedule makespans
• Extremal probability bounds in combinatorial optimization
• Euro-Par 2004 Parallel Processing
• A computational study on bounding the makespan distribution in stochastic project networks
• Efficient optimal Kolmogorov approximation of random variables
• Robust resource allocations in temporal networks
• Robust execution strategies for project scheduling with unreliable resources and stochastic durations

This page was built for publication: Scheduling under uncertainty: Bounding the makespan distribution

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