Sensitivity bounds for machine scheduling with uncertain communication delays

DOI10.1007/S10951-005-2864-6zbMath1123.90034OpenAlexW1968711453MaRDI QIDQ880514

Eric Sanlaville

Publication date: 15 May 2007

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

Full work available at URL: https://doi.org/10.1007/s10951-005-2864-6

zbMATH Keywords

uncertaintymachine schedulingsensitivity analysiscommunication delaystransportation delays

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

On robust online scheduling algorithms

Cites Work

• Unnamed Item
• A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
• On the calculation of the stability radius of an optimal or an approximate schedule
• List scheduling with and without communication delays
• Robust discrete optimization and its applications
• Project scheduling under uncertainty: survey and research potentials
• Robust scheduling of metaprograms
• A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Scheduling Precedence Task Graphs with Disturbances
• Scheduling UET Trees with Communication Delays on two Processors
• Parallel Machine Scheduling with Uncertain Communication Delays
• Sensitivity analysis of scheduling algorithms

This page was built for publication: Sensitivity bounds for machine scheduling with uncertain communication delays