Heuristic stability: a permutation disarray measure
From MaRDI portal
(Redirected from Publication:883278)
Recommendations
Cites work
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 3584785 (Why is no real title available?)
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
- Aggregating inconsistent information
- An Application of Bin-Packing to Multiprocessor Scheduling
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Match-up scheduling under a machine breakdown
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- On the calculation of the stability radius of an optimal or an approximate schedule
- Predictable scheduling of a single machine with breakdowns and sensitive jobs
- Probe backtrack search for minimal perturbation in dynamic scheduling
- Rescheduling job shops under random disruptions
- Sensitivity analysis for scheduling problems
- Sensitivity analysis of list scheduling heuristics
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)