A tabu search experience in production scheduling
- 1 September 1993
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 41 (3) , 139-156
- https://doi.org/10.1007/bf02023072
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemPublished by Elsevier ,2003
- Integrating target analysis and tabu search for improved scheduling systemsExpert Systems with Applications, 1993
- Hashing vectors for tabu searchAnnals of Operations Research, 1993
- A user's guide to tabu searchAnnals of Operations Research, 1993
- SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCHIIE Transactions, 1993
- SEQUENCING AND BATCHING FOR TWO CLASSES OF JOBS WITH DEADLINES AND SETUP TIMESProduction and Operations Management, 1992
- Job Shop Scheduling with Tooling Constraints: a Tabu Search ApproachJournal of the Operational Research Society, 1991
- Tabu search techniquesOR Spectrum, 1989
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959