Heuristic stability: A permutation disarray measure

Authors:
Heng-Soon Gan;Andrew Wirth
Affiliations:
Melbourne Operations Research (MORe), Department of Mathematics and Statistics, The University of Melbourne, Vic. 3010, Australia;Department of Mechanical and Manufacturing Engineering, The University of Melbourne, Vic. 3010, Australia
Venue:
Computers and Operations Research
Year:
2007

Citing 6
Cited 0

Matchup scheduling with multiple resources, release dates and disruptions

Operations Research
Sensitivity analysis of list scheduling heuristics

Discrete Applied Mathematics
Probe Backtrack Search for Minimal Perturbation in DynamicScheduling

Constraints
Sensitivity Analysis for Scheduling Problems

Journal of Scheduling
Aggregating inconsistent information: ranking and clustering

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Generating robust and flexible job shop schedules using genetic algorithms

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

Heuristic performance has been mainly measured by effectiveness (near optimality) and efficiency (computational complexity). More recently researchers have begun the difficult task of evaluating heuristic stability, or sensitivity, to perturbations in the problem specifications. Various stability measures have been proposed. Here we consider how Spearman's footrule, a measure of permutation disarray, may shed some further light on this, not as yet well understood, problem.