Heuristic stability: A permutation disarray measure

被引：1

作者：

Gan, Heng-Soon

Wirth, Andrew ^{[1
]}

机构：

[1] Univ Melbourne, Dept Mech & Mfg Engn, Melbourne, Vic 3010, Australia

[2] Univ Melbourne, Dept Math & Stat, MORe, Melbourne, Vic 3010, Australia

来源：

COMPUTERS & OPERATIONS RESEARCH | 2007年 / 34卷 / 11期

关键词：

robust scheduling; rescheduling stability; scheduling heuristics and algorithms;

D O I：

10.1016/j.cor.2005.11.025

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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. (C) 2005 Elsevier Ltd. All rights reserved.

引用

页码：3187 / 3208

页数：22

共 24 条

[1] Rescheduling job shops under random disruptions [J].