On the calculation of the stability radius of an optimal or an approximate schedule

DOI10.1023/A:1018960030420zbMath0911.90222OpenAlexW1498539033MaRDI QIDQ1273126

Frank Werner, Albert P. M. Wagelmans, Yuri N. Sotskov

Publication date: 6 December 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018960030420

zbMATH Keywords

stabilityschedulingstability analysisstability radiusdisjunctive graphlinear binary programmingapproximate schedule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Related Items

A robustness measure of the configuration of multi-purpose machines ⋮ Parallel Machine Scheduling with Uncertain Communication Delays ⋮ Robust scheduling of wireless sensor networks for target tracking under uncertainty ⋮ Stability of a schedule minimizing mean flow time ⋮ Sensitivity bounds for machine scheduling with uncertain communication delays ⋮ Heuristic stability: a permutation disarray measure ⋮ Minimizing total weighted completion time with uncertain data: a stability approach ⋮ Stability polyhedra of optimal permutation of jobs servicing ⋮ Balancing of simple assembly lines under variations of task processing times ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints ⋮ Uncertainty measure for the Bellman-Johnson problem with interval processing times ⋮ Minimizing total weighted flow time under uncertainty using dominance and a stability box ⋮ Comparing deterministic, robust and online scheduling using entropy ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ On the complexity of postoptimality analysis of \(0/1\) programs ⋮ Calculation of stability radii for combinatorial optimization problems