Some aspects of scatter search in the flow-shop problem

European Journal of Operational Research

Volumn 169, Issue 2, 2006, Pages 654-666

  Nowicki, Eugeniusz ^a   Smutnicki, Czeslaw ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Scatter search; Scheduling; Tabu search

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MACHINE SHOPS; ONLINE CONFERENCING; QUALITY ASSURANCE; SCHEDULING;

FLOW-SHOP PROBLEMS; MAKESPAN CRITERION; SCALABLE SYSTEMS; TIME-CONSUMING SOLUTION METHODS;

PROBLEM SOLVING;

EID: 25444486755     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.08.021     Document Type: Article

References (28)

1. B.A. Adenso-Díaz Restricted neighbourhood in the tabu search for the flowshop problem European Journal of Operational Research 62 1992 27 37
2. H.G. Campbell, R.A. Dudek, and M.L. Smith A heuristic algorithm for the n job m machine sequencing problem Management Science 16 1970 B630 B637
3. D.G. Dannenbring An evaluation of flow-shop sequencing heuristics Management Science 23 1977 1174 1182
4. J. Grabowski, and J. Pempera New block properties for the permutation flow shop problem with application in tabu search Journal of Operational Research Society 52 2000 210 220
5. F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic Publishers Boston, MA
6. 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 1990 194 206
7. M. Ishubuchi, S. Masaki, and H. Tanaka Modified simulated annealing for the flow shop sequencing problems European Journal of Operational Research 81 1995 388 398
8. D.E. Knuth The Art of Computer Programming 1977 Addison Wesley Longman
9. M. Laguna, and R. Marti Scatter Search. Methodology and Implementation in C 2003 Kluwer Academic Publishers Boston, MA
10. R. Marti, M. Laguna, F. Glover, Principles of Scatter Search. European Journal of Operational Research, this issue, pii:S0377-2217(04)00543-0.
11. M. Nawaz, E.E. Enscore Jr., and I. Ham A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem OMEGA International Journal of Management Science 11 1983 91 95
12. E. Nowicki, and C. Smutnicki A fast tabu search algorithm for the permutation flow-shop problem European Journal of Operational Research 91 1996 160 175
13. E. Nowicki, C. Smutnicki, Permutation flow-shop scheduling, Benchmarks results, Technical Report PRE 15/96, Institute of Engineering Cybernetics, Wrocaw University of Technology, 1996.
14. E. Nowicki, C. Smutnicki, Some new ideas in TS for job-shop scheduling, Technical Report 50/01, Institute of Engineering Cybernetics, Wroclaw University of Technology. In: C. Rego, B. Alidaee (Eds.), Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, Kluwer Academic Publishers, 2004, in print.
15. max flow-shop problem Computers and Operations Research 17 1990 243 253
16. I.H. Osman, and C.N. Potts Simulated annealing for permutation flow shop scheduling OMEGA 17 1989 551 557
17. C.R. Reeves A genetic algorithm for flow shop sequencing Computers and Operations Research 22 1995 5 13
18. C.R. Reeves, and T. Yamada Genetic algorithms, path relinking and the flowshop sequencing problem Evolutionary Computation 6 1998 45 60
19. C.R. Reeves Landscapes operators and heuristic search Annals of Operations Research 86 1999 473 490
20. H. Röck, and G. Schmidt Machine aggregation heuristics in shop scheduling Methods of Operations Research 45 1982 303 314
21. SpecBench, Available from: < http://www.specbench.org/osg/cpu95/ results/cint95.html>.
22. E. Taillard Some efficient heuristic methods for flow-shop sequencing European Journal of Operational Research 47 1990 65 74
23. E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 1993 278 285
24. E. Taillard, Home page, Avaiable from: < http://www.eivd.ch/ina/ collaborateurs/etd/default.htm >.
25. L. Wang, and D.Z. Zheng An effective hybrid heuristic for flow shop scheduling International Journal of Advanced Manufacturing Technology 21 2003 38 44
26. J.P. Watson, L. Barbulescu, L.D. Whitley, and A.E. Hove Contrasting structured and random permutation flow-shop scheduling problems: Search-space topology and algorithm performance INFORMS Journal of Computing 14 2002 98 123
27. F. Werner On the heuristic solution of the permutation flow shop problem Computers and Operations Research 20 1993 707 722
28. M. Widmer, and A. Hertz A new heuristic method for the flow-shop sequencing problem European Journal of Operational Research 42 1989 186 193