Solving the job shop scheduling problem with tabu search
- 27 April 1995
- journal article
- Published by Taylor & Francis Ltd in IIE Transactions
- Vol. 27 (2), 257-263
- https://doi.org/10.1080/07408179508936739
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Parallel Taboo Search Techniques for the Job Shop Scheduling ProblemINFORMS Journal on Computing, 1994
- Chapter 9 Sequencing and scheduling: Algorithms and complexityPublished by Elsevier BV ,1993
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- Tabu Search: A TutorialInforms Journal on Applied Analytics, 1990
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration AlgorithmOperations Research, 1969