Sensitivity analysis of scheduling algorithms

DOI10.1016/S0377-2217(00)00281-2zbMath0984.90044OpenAlexW2073703487MaRDI QIDQ5952510

Denis Trystram, Bernard Penz, Christophe Rapine

Publication date: 14 May 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00281-2

zbMATH Keywords

sensitivityindependent tasksmakespan and flowtime criteriaon-line disturbancesstatic scheduling policies

Mathematics Subject Classification ID

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

Related Items (11)

Sensitivity bounds for machine scheduling with uncertain communication delays ⋮ Sensitivity analysis of the unrelated parallel machine scheduling problem with rework processes and machine eligibility restrictions ⋮ Complexity of minimizing the total flow time with interval data and minmax regret criterion ⋮ Sensitivity analysis for some scheduling problems ⋮ Sensitivity analysis in the single-machine scheduling problem with max-min criterion ⋮ Scheduling with uncertainties on new computing platforms ⋮ Predictive-reactive scheduling on a single resource with uncertain future jobs ⋮ On robust online scheduling algorithms ⋮ Project scheduling under uncertainty: survey and research potentials ⋮ Modeling and Managing Uncertainty in Process Planning and Scheduling ⋮ A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty

Cites Work

• Robust discrete optimization and its applications
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Bounds on Multiprocessing Timing Anomalies
• A Priori Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sensitivity analysis of scheduling algorithms