A tabu-search heuristic for the flexible-resource flow shop scheduling problem
- 1 September 1993
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 41 (3) , 207-230
- https://doi.org/10.1007/bf02023075
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- A tabu search experience in production schedulingAnnals of Operations Research, 1993
- SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCHIIE Transactions, 1993
- A multi-objective approach to resource allocation in single machine schedulingEuropean Journal of Operational Research, 1990
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs TardyOperations Research, 1989
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- A new integer programming formulation for the permutation flowshop problemEuropean Journal of Operational Research, 1989
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- A Comparative Study of Flow-Shop AlgorithmsOperations Research, 1975