On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints

DOI10.1016/0885-064X(90)90003-VzbMath0694.68023MaRDI QIDQ909452

Giulia Galbiati

Publication date: 1990

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

optimizationschedulingapproximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems
• The Asymptotic Optimality of the LPT Rule
• Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
• Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
• Performance Guarantees for Scheduling Algorithms
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints