Sensitivity analysis of list scheduling heuristics

DOI10.1016/0166-218X(94)90005-1zbMath0824.90082OpenAlexW2095981830MaRDI QIDQ1339396

Antoon W. J. Kolen, Albert P. M. Wagelmans, Stan P. M. van Hoesel, Alexander H. G. Rinnooy Kan

Publication date: 10 October 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90005-1

zbMATH Keywords

heuristicssensitivity analysismakespanidentical parallel machineslist scheduling rules

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Parallel Machine Scheduling with Uncertain Communication Delays ⋮ Constructing the minimization diagram of a two-parameter problem ⋮ Parametric methods in integer linear programming ⋮ Stability of a schedule minimizing mean flow time ⋮ Heuristic stability: a permutation disarray measure ⋮ Sensitivity analysis of a fuzzy multiobjective scheduling problem ⋮ Stability analysis in discrete optimization involving generalized addition operations ⋮ Sensitivity analysis of the unrelated parallel machine scheduling problem with rework processes and machine eligibility restrictions ⋮ Sensitivity analysis for some scheduling problems ⋮ On robust online scheduling algorithms ⋮ Sensitivity analysis of a greedy heuristic for knapsack problems

Cites Work

• Unnamed Item
• The Asymptotic Optimality of the LPT Rule
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies