Hybrid tabu search for re-entrant permutation flow-shop scheduling problem
Authors:
- Jen-Shiang ChenJCJen-Shiang Chen
- Jason Chao-Hsien PanJPJason Chao-Hsien Pan
- Chien-Kuang WuCWChien-Kuang Wu
Open Access
- 1 April 2008
- journal article
- Published by Elsevier in Expert Systems with Applications
- Vol. 34 (3) , 1924-1930
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Managing simple re-entrant flow lines: theoretical foundation and experimental resultsIIE Transactions, 2001
- Decomposition methods for reentrant flow shops with sequence-dependent setup timesJournal of Scheduling, 2000
- A heuristic algorithm for two‐machine re‐entrant shop schedulingAnnals of Operations Research, 1999
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970