Comparison of iterative improvement techniques for schedule optimization

DOI10.1016/0377-2217(95)00162-XzbMATH Open0947.90581OpenAlexW2157661830MaRDI QIDQ1278321FDOQ1278321

Authors: Jürgen Dorn, Mario Girsch, Günther Skele, 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

Recommendations

• Improving local search heuristics for some scheduling problems. II
• Advanced search techniques for the job shop problem : a comparison
• Improving local search heuristics for some scheduling problems. I

zbMATH Keywords

optimizationgenetic algorithmstabu searchscheduling theory

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

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

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