A fast tabu search algorithm for the permutation flow-shop problem
- 1 May 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 91 (1) , 160-175
- https://doi.org/10.1016/0377-2217(95)00037-2
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- Restricted neighborhood in the tabu search for the flowshop problemEuropean Journal of Operational Research, 1992
- A new heuristic for the n-job, M-machine flow-shop problemEuropean Journal of Operational Research, 1991
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- A block approach for single-machine scheduling with release dates and due datesEuropean Journal of Operational Research, 1986
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum LatenessJournal of the Operational Research Society, 1983
- Flowshop and Jobshop Schedules: Complexity and ApproximationOperations Research, 1978
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970