An effective hybrid heuristic for flow shop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 21, Issue 1, 2003, Pages 38-44

  Wang, L ^a   Zheng, D Z ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Flow shop scheduling; Genetic algorithm; Hybrid heuristic; Simulated annealing

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; SIMULATED ANNEALING;

FLOW SHOP SCHEDULING; HYBRID HEURISTIC;

SCHEDULING;

EID: 0037278745     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001700300005     Document Type: Article

References (29)

1. M. R. Garey and D. S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco. 1979.
2. K. R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York. 1974.
3. M. Nawaz, E. Enscore Jr. and I. Ham, "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem", Omega, 11(1), pp. 91-95, 1983.
4. C. Koulamas, "A new constructive heuristic for the flowshop scheduling problem", European Journal of Operational Research, 105, pp. 66-71, 1998.
5. F. A. Ogbu and D. K. Smith, "Simulated annealing for the permutation flowshop problem", Omega, 19(1), pp. 64-67, 1990.
6. max flowshop problem", Computers and Operations Research, 17(3), pp. 243-253, 1990.
7. I. H. Osman and C. N. Potts, "Simulated annealing for permutation flow-shop scheduling", Omega, 17(6), pp. 551-557, 1989.
8. C. R. Reeves, "A genetic algorithm for flowshop sequencing", Computers and Operations Research, 22(1), pp. 5-13, 1995.
9. C. R. Reeves and T. Yamada, "Genetic algorithms, path relinking and the flowshop sequencing problem", Evolutionary Computation, 6, pp. 45-60, 1998.
10. E. Nowicki and C. Smutnicki, "A fast tabu search algorithm for the permutation flow-shop problem", European Journal of Operational Research, 91, pp. 160-175, 1996.
11. M. Widmer and A. Hertz, "A new heuristic method for the flow shop sequencing problem", European Journal of Operational Research, 41, pp. 186-193, 1989.
12. E. Taillard, "Some efficient heuristic methods for the flow shop sequencing problem", European Journal of Operational Research, 47, pp. 65-74, 1990.
13. J. Grabowski and J. Pempera, "New block properties for the permutation flowshop problem with application in tabu search", Journal of Operational Research Society, 52, pp. 210-220, 2001.
14. E. Taillard, "Benchmarks for basic scheduling problems", European Journal of Operational Research, 64, pp. 278-285, 1993.
15. L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
16. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
17. Y. Leung, Y. Gao and Z. B. Xu, "Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov-chain analysis", IEEE Transactions on Neural Networks, 8(5), pp. 1165-1176, 1997.
18. G. Rudolph, "Convergence properties of canonical genetic algorithms", IEEE Transactions on Neural Networks, 5(1), pp. 96-101, 1994.
19. R. Yang and I. Donglas, "Simple genetic algorithm with local turning-efficient global optimizing technique", Journal of Optimization Theory and Applications, 98(2), pp. 449-465, 1998.
20. S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, "Optimization by simulated annealing", Science, 220, pp. 671-680, 1983.
21. R. Cheng, M. Gen and Y. Tsujimura, "A tutorial survey of job-shop scheduling problems using genetic algorithms - I. Representation", Computers and Industrial Engineering, 30, pp. 983-997, 1996.
22. F. D. Croce, R. Tadei and G. Volta, "A genetic algorithm for the job shop problem", Computers and Operations Research, 22(1), pp. 15-24, 1995.
23. F. Q. Bac and V. L. Perov, "New evolutionary genetic algorithms for NP-complete combinatorial optimization problems", Biological Cybernetics, 69, pp. 229-234, 1993.
24. J. Carlier, "Ordonnancements a contraintes disjonctives", RAIRO Recherche operationelle/Operations Research, 12, pp. 333-351, 1978.
25. C. Dimopoulos and Ali. M. S. Zalzala, "Recent development in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons", IEEE Transactions on Evolutionary Computation, 4(2), pp. 93-113, 2000.
26. L. Wang and D. Z. Zheng, "Global derivative-free training for feed-forward neural networks", Third Asian Control Conference, Shanghai, China, 1570-1575, 2000.
27. L. Wang and D. Z. Zheng, "An effective hybrid optimization strategy for job-shop scheduling problems", Computers and Operations Research, 48, pp. 585-596, 2001.
28. L. Wang and D. Z. Zheng, "A modified genetic algorithm for job shop scheduling", International Journal of Advanced Manufacturing Technology, 20(1) pp. 72-76, 2002.
29. L. Wang and D. Z. Zheng, "Study on a class of GASA hybrid strategy and its convergence behavior", Control and Decision, 13(6), pp. 672-675, 1998.