Heuristic stability: a permutation disarray measure

DOI10.1016/J.COR.2005.11.025zbMATH Open1123.90026OpenAlexW2097654358MaRDI QIDQ883278FDOQ883278

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4189487
• Context-independent scatter and tabu search for permutation problems
• Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
• Spearman's footrule: asymptotics in applications
• Metrics in the permutation space

zbMATH Keywords

robust schedulingrescheduling stabilityscheduling heuristics and algorithms

Mathematics Subject Classification ID

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

Cites Work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883278)