Heuristic stability: a permutation disarray measure

DOI10.1016/j.cor.2005.11.025zbMath1123.90026OpenAlexW2097654358MaRDI QIDQ883278

Heng-Soon Gan, Andrew Wirth

Publication date: 4 June 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.025

zbMATH Keywords

robust schedulingrescheduling stabilityscheduling heuristics and algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• On the calculation of the stability radius of an optimal or an approximate schedule
• Sensitivity analysis of list scheduling heuristics
• Probe backtrack search for minimal perturbation in dynamic scheduling
• Match-up scheduling under a machine breakdown
• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• An Application of Bin-Packing to Multiprocessor Scheduling
• Rescheduling job shops under random disruptions
• Predictable scheduling of a single machine with breakdowns and sensitive jobs
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Sensitivity analysis for scheduling problems
• Aggregating inconsistent information

This page was built for publication: Heuristic stability: a permutation disarray measure