A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion

Computers and Operations Research

Volumn 31, Issue 11, 2004, Pages 1891-1909

  Grabowski, Jósef ^a   Wodecki, Mieczyslaw ^b  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

Flow shop scheduling; Heuristics; Makespan; Tabu search

Indexed keywords

ALGORITHMS; MACHINE SHOP PRACTICE; ONLINE SEARCHING; PERTURBATION TECHNIQUES; SCHEDULING;

FLOW SHOP PROBLEM; FLOW-SHOP SCHEDULING;

PROBLEM SOLVING;

ALGORITHM;

EID: 1942501670     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00145-X     Document Type: Article

References (20)

1. Grabowski J. Pempera J. New block properties for the permutation flow-shop problem with application in TS Journal of the Operational Research Society 52 2001 210-220
2. Ishubuchi M. Masaki S. Tanaka H. Modified simulated annealing for the flow shop sequencing problems European Journal of Operational Research 81 1995 388-398
3. Nowicki E. Smutnicki C. A fast tabu search algorithm for the permutation flow-shop problem European Journal of Operational Research 91 1996 160-175
4. max flow-shop problem Computers and Operations Research 17 1990 243-253
5. Osman I.H. Potts C.N. Simulated annealing for permutation flow shop scheduling OMEGA 17 1989 551-557
6. Reeves C.R. Yamada T. Genetic algorithms, path relinking and the flowshop sequencing problem Evolutionary Computation 6 1998 45-60
7. Taillard E. Some efficient heuristic methods for flow-shop sequencing European Journal of Operational Research 47 1990 65-74
8. Taillard E. Benchmarks for basic scheduling problems European Journal of Operational Research 64 1993 278-285
9. Werner F. On the heuristic solution of the permutation flow shop problem Computers and Operations Research 20 1993 707-722
10. Widmer M. Hertz A. A new heuristic method for the flow-shop sequencing problem European Journal of Operational Research 42 1989 186-193
11. Grabowski J, Wodecki M. A very fast tabu search algorithm for the job shop problem. Technical Report 21/2001, Institute of Engineering Cybernetics, Wroclaw University of Technology. In: Rego C, Alidaee B, editors. Adaptive memory and evolution; tabu search and scatter search. Dordrecht: Kluwer Academic Publishers, 2003, in print.
12. Grabowski J. Generalized problems of operations sequencing in the discrete production systems (Polish). Monographs 9, Scientific Papers of the Institute of Technical Cybernetics of Wroclaw Technical University, 1979.
13. Grabowski J. On two-machine scheduling with release and due dates to minimize maximum lateness Opsearch 17 1980 133-154
14. Grabowski J. A new algorithm of solving the flow-shop problem Feichtinger G. Kall P. Operations research in progress 1982 57-75 Reidel Publishing Company Dordrecht
15. Glover F. Tabu search. Part I ORSA Journal of Computing 1 1989 190-206
16. Glover F. Tabu search. Part II ORSA Journal of Computing 2 1990 4-32
17. Grabowski J. Nowicki E. Zdrzalka S. A block approach for single machine scheduling with release dates and due dates European Journal of Operational Research 26 1986 278-285
18. Grabowski J. Skubalska E. Smutnicki C. On flow-shop scheduling with release and due dates to minimize maximum lateness Journal of the Operational Research Society 34 1983 615-620
19. OR Library: http://mscmga.ms.ic.ac.uk/info.html
20. Nowicki E, Smutnicki C. Permutation flow-shop scheduling. Benchmarks results, Technical Report PRE 15/96, 1996, Technical University of Wroclaw.