A tabu search based heuristic for a flexible flow line with minimum flow time criterion

International Journal of Industrial Engineering : Theory Applications and Practice

Volumn 5, Issue 2, 1998, Pages 157-168

  Chen, Chuen Lung ^a   Usher, John M ^a   Palanimuthu, Nagarajan ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

Flexible Flow Line; Minimum Flow Time Criterion; Search Heuristic; Tabu Search

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROCESS CONTROL; PRODUCTION CONTROL; SCHEDULING;

FLEXIBLE FLOW LINE (FLL); MINIMUM FLOW TIME CRITERIONS; SEARCH HEURISTICS; TABU SEARCH METHOD;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 0032099023     PISSN: 10724761     EISSN: 1943670X     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. Adenso-Diaz, B. (1992). Restricted neighborhood in the tabu search for the flowshop problem. European Journal of Operations Research, 62: 27-37.
2. Arthanari, T.S. and Ramamurthy, K.S. (1972). An extension of two machines sequencing problem, Operations Research, 8: 10-22.
3. Barnes, J. W. and Laguna, M. (1993). Solving the multiple-machine weighted flow time problem using tabu search. IIE Transactions, 25: 121-128.
4. Dell'Amico, M. and Trubian, M. (1992). Applying tabu search to the job-shop scheduling problem. Annals of Operations Research,41: 231-252.
5. Glover, F. (1989). Tabu search, part I. ORSA Journal on Computing, I: 190-206.
6. Glover, F. and Laguna, M. (1993). Tabu Search. In Modern Heuristic Techniques for Combinatorial problems, (Ed.: C.R. Reeves), Blackwell ScientificPublications, Oxford, pp. 71-150.
7. Glover, F., Taillard, E. and de Werra. D. (1993). A user' guide to tabu search. Operations Research, 41: 3-28.
8. Gupta, J.N.D. (1988). Two-stage, hybrid flowshop scheduling problem. Journal of the Operational Research Society. 39: 359-364.
9. Johnson S. M. (1954). Optimal two- and three-stage production schedules with set-up times included. Naval Research Logistics Quarterly, 1.: 61-68.
10. Kim, Y. (1993). Heuristics for flow shop scheduling problems minimizing mean tardiness. Journal of the Operational Research Society, 44: 19-28.
11. Kochhar, S. and Morris, R.J.T. (1987). Heuristics Methods for Flexible Flow Line Scheduling. Journal of Manufacturing Systems, 6: 299-314.
12. Mittal, B.S. and Bagga, P.C. (1972). Two machine sequencing problem with parallel machines. Operations Research, 9: 50-59.
13. Murty, R.N. (1974). On two machine sequencing problems with parallel machines. Operations Research, 11: 42-44.
14. Rajendran, C. and Chaudhuri, D. (1992). A multi-stage parallel-processor flowshop problem with minimum flowtime. European Journal of Operational Research, 57: 111-122.
15. Salvador, M.S. (1973). A Solution to a Special Case of Flow Shop Scheduling Problems. In Symposium of the Theory of Scheduling and Applications (Ed.: S.E. Elmaghraby), Springer-Verlag, New York.
16. Szwarc, W. (1983). The flowshop problem with mean completion time criterion. HE Transactions. 15: 172-176.
17. Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47: 65-67.
18. Widmer, M. and Hertz, A. (1989). A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research, 41: 186-193.
19. Widmer, M. (1989). Job shop scheduling with tooling constraints: a tabu search approach. Journal of the Operational Research Society, 42: 75-82.
20. Wittrock, R.J. (1985). Scheduling Algorithms for Flexible Flow Lines. IBM Journal of Research and Development.29: 401-412.
21. Wittrock, R.J. (1988). An Adaptable Scheduling Algorithms for Flexible Flow Lines. Operations Research, 33: 445-453.
22. Yap, L. Y. (1994). A tabu search approach to the permutation flow shop problem with minimizing total flow time as the criterion. Unpublished Master's thesis, Mississippi State University.