A review of TSP based approaches for flowshop scheduling
- Additional Document Info
- View All
Contemporary flowshops that are variants of the classical flowshop frequently pose challenging scheduling problems. Such flowshops include no-wait, blocking, and robotic flowshops. These may sometimes be modeled as traveling salesman problems (TSP) and then solved using efficient algorithms available for the TSP. Encountered in auto, electronic, chemical, steel and even modern service industries, such problems are reviewed in this paper. We show that the TSP based approach is quite effective over a broad range. It tackles no-wait flowshops, blocking flowshops, group scheduling of parts in a flowshop using a generalized extension of the TSP, lot streaming and scheduling problems, and as recently done, scheduling of parts and robot movements in automated production cells. In this review paper, we describe several well-documented applications of no-wait and blocking scheduling models and illustrate some ways in which the increasingly used modern manufacturing systems such as robotic cells may be modeled as TSP. We also review the computational complexity of a wide variety of flowshop models. Finally, we suggest some fruitful directions for future research. © 2005 Elsevier B.V. All rights reserved.
author list (cited authors)
Bagchi, T. P., Gupta, J., & Sriskandarajah, C.
complete list of authors
Bagchi, Tapan P||Gupta, Jatinder ND||Sriskandarajah, Chelliah