Applying tabu search to the job-shop scheduling problem
- 1 September 1993
- journal article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 41 (3), 231-252
- https://doi.org/10.1007/bf02023076
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Job Shop Scheduling by Simulated AnnealingOperations Research, 1992
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- Semi-greedy heuristics: An empirical studyOperations Research Letters, 1987
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier BV ,1979
- A Survey of Scheduling RulesOperations Research, 1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976