Multi-objective genetic algorithm and its applications to flowshop scheduling

Computers and Industrial Engineering

Volumn 30, Issue 4, 1996, Pages 957-968

  Murata, Tadahiko ^a   Ishibuchi, Hisao ^a   Tanaka, Hideo ^a  

^a Osaka Prefecture University   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING; SIMULATED ANNEALING;

COMPLEX RANDOM SAMPLING METHOD; FLOWSHOP SCHEDULING; SINGLE OBJECTIVE GENETIC ALGORITHM; VECTOR EVALUATED GENETIC ALGORITHM;

GENETIC ALGORITHMS;

EID: 0030241820     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/0360-8352(96)00045-9     Document Type: Article

References (16)

1. S. M. Johnson. Optimal two- and three-stage production schedules with setup times included. Naval Res. Logistics Q. 1(1), 61-68 (1954).
2. D. G. Dannenbring. An evaluation of flowshop sequencing heuristics. Mgmt Sci. 23, 1174-1182 (1977).
3. M. Nawaz Jr, E. E. Enscore and I. Ham. A heuristic algorithm for m-machine, n-job flowshop sequencing problem. OMEGA 11, 91-98 (1983),
4. I. H. Osman and C. N. Potts. Simulated annealing for permutation flow-shop scheduling. OMEGA 17(6), 551-557 (1989).
5. M. Widmer and A. Hertz. A new heuristic method for the flowshop sequencing problem. Europ. J. Opnl Res. 41(2), 186-193 (1990).
6. E. Ignall and L. E. Schrage. Application of branch- and bound technique to some flow shop problems. Ops Res. 13(3), 400-412 (1965).
7. Z. Lomnicki. A branch- and -bound algorithm for the exact solution of the three-machine scheduling program. Opnl Res. Q. 16(1), 89-107 (1965).
8. J. C. Ho and Y.-L. Chang. A new heuristic for the n-job, m-machine flowshop problem. Europ. J. Opnl Res. 52, 194-202 (1991).
9. R. Gangadharan and C. Rajendran. A simulated annealing heuristic for scheduling in a flowshop with bicriteria. Proc. 16th Int. Conf. on Computers Ind. Engng 345-348, 7-9 Mar. (1994).
10. K. Morizawa, T. Ono, H. Nagasawa and N. Nishiyama. An interactive approach for searching a preferred schedule. J. Japan Ind. Mgmt Assoc. 44(4), 277-283 (1993, in Japanese).
11. J. D. Schaffer. Multiple objective optimization with vector evaluated genetic algorithms. Proc. 1st ICGA, pp. 93-100 (1985).
12. M. Gen, K. Ida, E. Kono and Y. Li. Solving bicriteria solid transportation problem by genetic algorithm. Proc. 16th Int. Conf. on Computers Ind. Engng, 572-575, 7-9 Mar. (1994).
13. H. Tamaki, M. Mori, M. Araki, Y. Mishima and H. Ogai. Multi-criteria optimization by genetic algorithms: a case of scheduling in hot rolling process. Proc. APORS'94, 374-381, 26-29 July (1994).
14. J. Horn, N. Nafpliotis and D. E. Goldberg. A niched Pareto genetic algorithm for multiobjective optimization. Proc. 1st CIEC, pp. 82-87 (1994).
15. T. Murata, H. Ishibuchi and H, Tanaka, Genetic algorithms for flowshop scheduling problems. Computers ind. Engng (to appear).
16. R. A. Dudek, S. S. Panwalkar and M. L. Smith, The lessons of flowshop scheduling research. Ops Res. 40(1), 7-13 (1992).