Hybrid tabu search for re-entrant permutation flow-shop scheduling problem

  title={Hybrid tabu search for re-entrant permutation flow-shop scheduling problem},
  author={Jen-Shiang Chen and Jason Chao-Hsien Pan and Chien-Kuang Wu},
  journal={Expert Syst. Appl.},
The assumption of classical shop scheduling problems that each job visits each machine only once (Baker, 1974) is often violated in practice. A new type of manufacturing shop, the reentrant shop has recently attracted attention. The basic characteristic of a re-entrant shop is that a job visits certain machines more than once. For example, in semiconductor manufacturing, consequently, each wafer re-visits the same machines for multiple processing steps (Vargas-Villamil & Rivera, 2001). The… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 20 extracted citations


Publications referenced by this paper.
Showing 1-10 of 30 references

The shifting bottleneck procedure for job shop scheduling

J. Adams, E. Balas, D. Zawack
Management Science, • 1988
View 9 Excerpts
Highly Influenced

Computer and Job Shop Scheduling. Wiley, ISBN: 0471163198

E. G. Coffman
View 5 Excerpts
Highly Influenced

Introduction to sequencing and scheduling

K. R. Baker
View 7 Excerpts
Highly Influenced

A Fast Taboo Search Algorithm for the Job Shop Scheduling Problem

Uffe Gram Christensen, Anders Pedersen, Kim Vejlin
View 2 Excerpts

Managing simple re-entrant flow lines: theoretical foundation and experimental results

C. F. Bispo, S. Tayur
IIE Transactions, • 2001
View 1 Excerpt

Decomposition methods for re-entrant flow shops with sequence-dependent setup times

E. Demirkol, R. Uzsoy
Journal of Scheduling, • 2000
View 1 Excerpt

Similar Papers

Loading similar papers…