Designing a tabu search algorithm to minimize total flow time in a flow shop

Arabian Journal for Science and Engineering

Volumn 25, Issue 1 C, 2000, Pages 79-94

  Gupta, Jatinder N D ^a   Chen, Chuen Lung ^b   Yap, Lee Yee ^b   Deshmukh, Harshwardhan ^b  

^a BALL STATE UNIVERSITY   (United States)

^b MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

Empirical evaluation; Flowshop scheduling; Minimum flow time; Tabu search

Indexed keywords

EID: 0034347055     PISSN: 2193567X     EISSN: 21914281     Source Type: Journal    
DOI: None     Document Type: Review

References (24)

1. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, "Sequencing and Scheduling: Algorithms and Complexity", in Logistics of Production and Inventory. ed. S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin. Amsterdam: North Holland, 1993, pp. 445-522.
2. B. Chen, C.N. Potts, and G.J. Woeginger, "A Review of Machine Scheduling: Complexity, Algorithms and Applications", in Handbook of Combinatorial Optimization. ed. D-Z Du and P. M. Pardalos. Dordrecht: Kluwer, 1998, pp. 21-169.
3. S.M. Johnson, "Optimal Two and Three Stage Production Schedules with Setup Times Included", Naval Research Logistics Quarterly, 1 (1954), pp. 61-68.
4. M.R. Garey, D.S. Johnson, and R. Sethi, "The Complexity of Flowshop and Jobshop Scheduling", Mathematics of Operations Research, 1 (1976), pp. 117-129.
5. E. Ignall and L.E. Schrage, "Application of Branch and Bound Technique to Some Flow-shop Problem", Operations Research, 13 (1965), pp. 400-412.
6. S.P. Bansal, "Minimizing the Sum of Completion Times of n-Jobs Over m-Machines in a Flowshop", AIIE Transactions, 9 (1977), pp. 306-311.
7. J.N.D. Gupta, "Optimal Scheduling in a Multi-stage Flowshop", AIIE Transactions, 4 (1972), pp. 238-243.
8. J.C. Ho and Y.L. Chang, "A New Heuristic for the n-Job, m-Machine Flow-shop Problem", European Journal of Operational Research, 52 (1991), pp. 194-202.
9. C. Rajendran, "Heuristic Algorithm for Scheduling in a Flowshop to Minimize Total Flow Time", International Journal of Production Economics, 29 (1993), pp. 65-73.
10. F. Glover, "Tabu Search and Adaptive Memory Programming-Advances, Applications and Challenges", in Interfaces in Computer Science and Operations Research. ed. R.S. Barr, R.V. Helgason, and J.L. Kennington. Dordrecht: Kluwer, 1986, pp. 1-75.
11. F. Glover and M. Laguna, "Tabu Search", in Modern Heuristic Techniques for Combinatorial Problems. ed. C. Reeves. Oxford: Blackwell, 1993, pp. 70-150.
12. F. Glover and M. Laguna, Tabu Search. Dordrecht: Kluwer, 1997.
13. F. Glover, "Tabu Search, part I", ORSA Journal of Computing, 1 (1989), pp. 190-206.
14. M. Widmer and A. Hertz, "A New Heuristic Method for the Flowshop Sequencing Problem", European Journal of Operational Research, 41 (1989), pp. 186-193.
15. E. Taillard, "Some Efficient Heuristic Methods for the Flowshop Sequencing Problem", European Journal of Operational Research, 47 (1990), pp. 65-74.
16. B. Adenso-Días, "Restricted Neighborhood in the Tabu Search for the Flowshop Problem", European Journal of Operational Research, 62 (1992), pp. 27-37.
17. Y. Kim, "Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness", Journal of Operational Research Society, 44 (1993), pp. 19-28.
18. J. Skorin-Kapov and A.J. Vakharia, "Scheduling a Flow-line Manufacturing Cell: a Tabu Search Approach", International Journal of Production Research, 31 (1993), pp. 1721-1734.
19. C.R. Reeves, "Improving the Efficiency of Tabu Search for Machine Sequencing Problems", Journal of Operational Research Society, 44 (1993), pp. 375-382.
20. E.J. Anderson, C.A. Glass, and C.N. Potts, "Machine Scheduling", in Local Search in Combinatorial Optimization. ed. E. Aarts and J.K. Lenstra. Chichester, England: Wiley, 1997, pp. 361-414.
21. J.N.D. Gupta, N. Palanimuthu, and C.-L. Chen, "Designing a Tabu Search Algorithm for the Two-Stage Flow Shop Problem with Secondary Criterion", Production Planning and Control: An International Journal, 10 (1999), pp. 251-265.
22. E. Nowicki, "The Permutation Flow Shop with Buffers: A Tabu Search Approach", European Journal of Operational Research, 116 (1999), pp. 205-219.
23. P.A. Games and J.F. Howell, "Pairwise Multiple Comparison Procedures with Unequal N's and/or Variances", Journal of Educational Statistics, 1 (1976), pp. 113-125.
24. A.J. Klockars and G. Sax, Multiple Comparisons. San Francisco: Sage, 1986.