Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance

References

• Ben-Daya M., Al-Fawzan M. A tabu search approach for the flow shop scheduling problem. European Journal of Operational Research (1998) 109:88–95Crossref, Google Scholar
• Boese K. D., Kahng A. B., Muddu S. A new adaptive multistart technique for combinatorial global optimization. Operations Research Letters (1994) 16:101–113Crossref, Google Scholar
• Dudek R. A., Panwalker S. S., Smith M. L. The lessons of flowshop scheduling research. Operations Research (1992) 40:7–13Link, Google Scholar
• Frank J., Cheeseman P., Stutz J. When gravity fails: local search topology. Journal of Artificial Intelligence Research (1997) 7:249–281Crossref, Google Scholar
• Garey M. R., Johnson D. S., Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research (1976) 1:117–129Link, Google Scholar
• Hooker J. H. Testing heuristics: we have it all wrong. Journal of Heuristics (1995) 1:33–42Crossref, Google Scholar
• Nawaz M., Enscore E., Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA, The International Journal of Management Science (1983) 11:91–95Crossref, Google Scholar
• Nowicki E., Smutnicki C. A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research (1996) 91:160–175Crossref, Google Scholar
• Panwalker S. S., Dudek R. A., Smith M. L., Elmaghraby S. Sequencing research and the industrial scheduling problem. Proceedings of Symposium on Theory of Scheduling and its Applications (1973) (Springer-Verlag, New York) 29–38Crossref, Google Scholar
• Pinedo M.Scheduling: Theory, Algorithms, and Systems (1995) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Reeves C. R. Improving the efficiency of tabu search in machine sequencing problems. Journal of the Operational Research Society (1993) 44:375–382Crossref, Google Scholar
• Reeves C. R. A genetic algorithm for flowshop sequencing. Computers and Operations Research (1995) 22:5–13Crossref, Google Scholar
• Reeves C. R., Yamada T. Genetic algorithms, path relinking, and the flowshop sequencing problem. Evolutionary Computation (1998) 6:45–60Crossref, Google Scholar
• Rinnooy Kan A. H. G.Machine Scheduling Problems: Classification, Complexity and Computations (1976) (Martinus Nijhoff, The Hague, The Netherlands) Google Scholar
• Stützle T. Applying iterated local search to the permutation flow shop problem. (1999) . Technical Report AIDA-98-04, Darmstadt University of Technology, Computer Science Department, Intellectics Group, Darmstadt, GermanyGoogle Scholar
• Taillard E. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research (1990) 47:65–74Crossref, Google Scholar
• Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research (1993) 64:278–285Crossref, Google Scholar
• Taillard E. Comparison of iterative searches for the quadratic assignment problem. Location Science (1995) 3:87–105Crossref, Google Scholar
• Watson J-P., Barbulescu L., Howe A. E., Whitley L. D., Hendler J., Kautz H. Algorithm performance and problem structure for flowshop scheduling. Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99), Orlando, Florida, July 1999 (1999) (AAAI Press/The MIT Press)688–695Google Scholar