Solving the flow shop problem by parallel tabu search

Proceedings - International Conference on Parallel Computing in Electrical Engineering, PARELEC 2002

Volumn , Issue , 2002, Pages 189-194

  Bozejko, W ^a   Wodecki, M ^b  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

Computer science; Computer simulation; Finishing; Genetic algorithms; Job shop scheduling; Parallel processing; Processor scheduling; Scheduling algorithm; Search methods; Simulated annealing

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; COMPUTER SIMULATION; FINISHING; GENETIC ALGORITHMS; HEURISTIC METHODS; JOB SHOP SCHEDULING; MACHINE SHOP PRACTICE; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS; SIMULATED ANNEALING; TABU SEARCH;

HEURISTIC TECHNIQUES; PARALLEL IMPLEMENTATIONS; PARALLEL PROCESSING; PARALLEL TABU SEARCH; PERMUTATION FLOW SHOPS; PROCESSOR SCHEDULING; SEARCH METHOD; SEQUENCING PROBLEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 13944267333     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCEE.2002.1115237     Document Type: Conference Paper

References (20)

1. Eikelder H., Aarts B., Verhoeven M., Aarts E., "Sequential and parallel local search algorithms for job shop scheduling", in Voss S.(Ed.) Meta-heuristics, Kluwer Academic Publishers, Boston, 1999, pp. 359-371.
2. Garey M.R., D.S. Johnson, R. Seti, "The complexity of flowshop and jobshop scheduling", Mathematics of Operations Research 1, 1976, pp. 117-129.
3. Glover F. "Future Paths for Integer Programming and Links to Artificial Intelligence Problem", Computers and Operations Research 13, 1986, pp. 533-549.
4. Grabowski J., "A new algorithm of solving the flow-shop problem", Operations Research in Progress. D. Reidel Publishing Company, 1982, pp. 57-75.
5. Grabowski J., Pempera J., "New block properties for the permutation flow-shop problem with application in TS", Journal of Operations Research Society 52, 2001, pp. 210-220.
6. Hansen P., "The Steepest Ascent Mildest Descent Heuristic for Combinatorial Programming", Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy, 1986.
7. Ignall E., L.E. Schrage, "Application of the branch-and-bound technique to some flow-shop scheduling problems", Operations Research 13/3, 1965, pp. 400-412.
8. Ishibuchi H., S. Misaki, H. Tanaka, "Modified Simulated Annealing Algorithms for the Flow Shop Sequencing Problem", European Journal of Operational Research 81, 1995, pp. 388-398.
9. Johnson S.M., "Optimal two and three-stage production schedules with setup times included", Naval Research Logistic Quertely 1, 1954, pp. 61-68.
10. Lageweg B.J., J.K., Lenstra, A.H.G. Rinnooy Kan, "A General Bounding Scheme for the Permutation Flow-Schop Problem", Operations Research 26, 1978, pp. 53-67.
11. Navaz M., E.E. Enscore Jr, and I. Ham, "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem", OMEGA 11/1, 1983, pp. 91-95.
12. Nowicki E., C. Smutnicki, "A fast tabu search algorithm for the permutation flow-shop problem", European Journal of Operational Research 91, 1996, pp. 160-175.
13. Ogbu F., D. Smith, "The Application of the Simulated Annealing Algorithm to the Solution of the n|m|Cmax Flowshop Problem", Computers and Operations Research 17(3), 1990, pp. 243-253.
14. Osman I., C. Potts, "Simulated Annealing for Permutation Flow-Shop Scheduling" OMEGA 17(6), 1989, pp. 551-557.
15. Reeves C., "Improving the Efficiency of Tabu Search for Machine Sequencing Problems", Journal of Operational Research Society 44(4), 1993, pp. 375-382.
16. Reeves C., "A Genetic Algorithm for Flowshop Sequencing", Computers and Operations Research 22(1), 1995, pp. 5-13.
17. Taillard E., "Some efficient heuristic methods for the flow shop sequencing problem", European Journal of Operational Research 47(1), 1990, pp. 65-74.
18. Taillard E., "Benchmarks for basic scheduling problems", European Journal of Operational Research 64, 1993, pp. 278-285.
19. Talbi E.G., Hafdi Z., Geib J.M., "Parallel tabu search for large optimization problems", in Voss S.(Ed.) Meta-heuristics, Kluwer Academic Publishers, Boston, 1999, pp. 345-358.
20. Wodecki M., Bozejko W., "Solving the flow shop problem by parallel simulated annealing", Lecture Notes in Computer Science 2328, Springer Verlag, Heidelberg, 2002, pp. 236-247.