Comparison of iterative improvement techniques for schedule optimization
From MaRDI portal
Publication:1278321
Recommendations
Cites work
- scientific article; zbMATH DE number 4174360 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 194622 (Why is no real title available?)
- scientific article; zbMATH DE number 4115948 (Why is no real title available?)
- Depth-first iterative-deepening: An optimal admissible tree search
- Job Shop Scheduling by Simulated Annealing
- Reactive scheduling: improving the robustness of schedules and restricting the effects of shop floor disturbances by fuzzy reasoning
- Tabu search techniques. A tutorial and an application to neural networks
- The Lessons of Flowshop Scheduling Research
Cited in
(3)- A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning
- 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
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)