A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates

DOI10.1007/s10288-003-0028-0zbMath1057.90022OpenAlexW2017102717MaRDI QIDQ1885338

Marc Sevaux, Kenneth Sörensen

Publication date: 28 October 2004

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-003-0028-0

zbMATH Keywords

genetic algorithmsingle machine schedulingweighted number of late jobsQuality robustnesssolution robustness

Mathematics Subject Classification ID

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

Related Items (8)

Robust optimization for the cyclic hoist scheduling problem ⋮ Minimizing recovery cost of network optimization problems ⋮ A methodology to create robust job rotation schedules ⋮ Minimizing total weighted flow time under uncertainty using dominance and a stability box ⋮ Minimizing total weighted flow time of a set of jobs with interval processing times ⋮ Min-max controllable risk problems ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Robustness in operational research and decision aiding: a multi-faceted issue

This page was built for publication: A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates