A memetic algorithm for the n/2/Flowshop/αF + βCmax scheduling problem

International Journal of Advanced Manufacturing Technology

Volumn 20, Issue 6, 2002, Pages 464-473

  Yeh, W C ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Branch and bound algorithm; Flowshop scheduling problem; Genetic algorithm; Heuristic algorithm; Local search method; Memetic algorithm

Indexed keywords

DECISION MAKING; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

BRANCH-AND BOUND-ALGORITHM; LOCAL SEARCH METHOD; MEMETIC ALGORITHM;

SCHEDULING;

EID: 0036393780     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001700200179     Document Type: Article

References (23)

1. W. E. Smith, "Various optimizers for single stage production", Naval Research Logistics Quarterly, 3, pp. 59-66, 1956.
2. S. K. Gupta and J. Kyparisis, "Single machine scheduling research", Omega, 15, pp. 207-227, 1987.
3. T. D. Fry, R. D. Armstrong and H. A. Lewis, "Framework for single machine multiple objective sequencing research, Omega, 17, pp. 595-607, 1979.
4. A. Nagar, J. Haddock and S. S. Hegaru, "Multiple and bicriteria scheduling: a literature review", European Journal of Operational Research, 81, pp. 88-104, 1995.
5. R. A. Dudek, S. S. Panwalker and M. L. Smith, "The lessons of flowshop scheduling research", Operations Research, 40, pp. 7-13, 1992.
6. W. J. Selen and D. Hott, "A mixed integer goal programming formulation of the standard flowshop scheduling problem", Journal of the Operational Research Society, 37, pp. 1121-1128, 1986.
7. J. M. Wilson, "Alternative formulations of a flowshop scheduling problem", Journal of the Operational Research Society, 40, pp. 395-399, 1989.
8. T. Gonzalez and T. Sen, "Flowshop and Jobshop Schedules: Complexity and Approximations", Operations Research, 26, pp. 36-52, 1978.
9. M. R. Garey, D. S. Johnson and R. R. Sethi, "The complexity of flowshop and jobshop scheduling", Operations Research, 1, pp. 117-129, 1976.
10. S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Ellis Horwood, Chichester, 1982.
11. E. L. Lawler, L. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, "Sequencing and scheduling: algorithms and complexity", in S.C. Graves, A. H. G. Rinnooy Kan and P. Zipkin (ed.), Handbooks in Operations Research and Management Science, vol 4, Logistics of Production and Inventory, North-Holland, Amsterdam, pp. 455-522, 1993.
12. A. Nagar, S. H. Sunderesh and J. Haddock, "A branch-and-bound approach for a two-machine flowshop scheduling problem", Journal of the Operational Research Society, 46, pp. 721-734, 1995.
13. max flowshop scheduling problem", Computers and Operations Research, 26, pp. 1293-1310, 1999.
14. W. C. Yeh, "An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem", Journal of Manufacturing Systems, 20, pp. 113-123, 2001.
15. N. R. Smith, F. Al-Khayyal and F. Griffin, "A tree-search method for solving a cutting stock assignment problem", International Journal of Production Research, 38, pp. 1557-1578, 2000.
16. C. A. Cotta, J. F. Aldana, A. J. Nebreo and J. M. Troya, "Hybridizing genetic algorithms with branch-and-bound techniques for the resolution of the TSP", Artificial Neural Nets and Genetic Algorithm, pp. 277-280, 1995.
17. S. Ghoshray, K. K. Yeh and J. Andrian, "Modified genetic algorithms by efficient unification with simulated annealing", Artificial Neural Nets and Genetic Algorithm, pp. 487-490, 1995.
18. E. M. Robert, "Breeding hybrid strategies: optimal behavior for ologopolists", Proceeding of 3th International Conference on Genetic Algorithms, pp. 198-207, 1989.
19. K. Takashi, K. Hiroaki and N. Masakazu, "A hybrid search for genetic algorithms: combining genetic algorithms, tabu search, and simulated annealing", Proceeding of 5th International Conference on Genetic Algorithms, p. 641, 1993.
20. P. Moscato and M. Norman, "A memetic approach for the traveling salesman problem: implementation of a computational ecology for combinatorial optimization on message-passing system", Proceeding of 20th International Conference on Parallel Computing and Transportation Applications, 1992.
21. M. Hattori, M. Naruse, J. Shirataki and T. Tomikawa, "A study of parameter optimization in mega-genetic algorithm", Proceeding of 20th International Conference on Computers and Industrial Engineering, pp. 445-448, 1996.
22. G. Leipins and M. Hilliard, "Genetic algorithm: foundation and applications", Annals of Operations Research, 21, pp. 31-58, 1989.
23. W. C. Yeh "A memetic algorithm for the min k-cut problem", Control and Intelligent Systems, 28, pp. 47-55, 2000.