Sensitivity analysis of scheduling algorithms

DOI10.1016/S0377-2217(00)00281-2MaRDI QIDQ5952510zbMATH OpenOpenAlexWikidataFDO

Authors Bernard Penz, Christophe Rapine, Denis Trystram

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

independent tasksmakespan and flowtime criteriaon-line disturbancessensitivitystatic scheduling policies

Mathematics Subject Classification ID

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

Recommendations

• Sensitivity Analysis for Stochastic Scheduling Problems
• Sensitivity analysis for scheduling problems
• Sensitivity analysis for scheduling problems
• Sensitivity analysis for some scheduling problems
• Sensitivity bounds for machine scheduling with uncertain communication delays

Cites work

• A Priori Optimization
• Bounds on Multiprocessing Timing Anomalies
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 108110 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• scientific article; zbMATH DE number 934540 (Why is no real title available?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Robust discrete optimization and its applications

Cited in

(15)

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

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

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