Comparison of iterative improvement techniques for schedule optimization

DOI10.1016/0377-2217(95)00162-XzbMath0947.90581OpenAlexW2157661830MaRDI QIDQ1278321

Mario Girsch, Günther Skele, Jürgen Dorn, Wolfgang Slany

Publication date: 22 April 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00162-x

zbMATH Keywords

optimizationtabu searchgenetic algorithmsscheduling theory

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Optimal and heuristic lead-time quotation for an integrated steel mill with a minimum batch size ⋮ Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study ⋮ A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Depth-first iterative-deepening: An optimal admissible tree search
• Tabu search techniques. A tutorial and an application to neural networks
• The Lessons of Flowshop Scheduling Research
• Job Shop Scheduling by Simulated Annealing
• Reactive scheduling: improving the robustness of schedules and restricting the effects of shop floor disturbances by fuzzy reasoning

This page was built for publication: Comparison of iterative improvement techniques for schedule optimization