Associate Professor Tsung-Che Chiang

Department of Computer Science and Information Engineering
National Taiwan Normal University

Tel: +886-2-77346692    Fax: +886-2-29322378    Email

Tsung-Che Chiang and Li-Chen Fu, Multiobjective job shop scheduling using genetic algorithm with cyclic fitness assignment, Proc. of IEEE Congress on Evolutionary Computation, pp. 11035 - 11042, July, 2006. (EI)

Full text: IEEEXplore

Abstract

A job shop scheduling problem with total tardiness and the maximum tardiness as objectives is addressed. We solve it by a rule-coded genetic algorithm. Characteristics of three existing fitness assignment mechanisms are identified and then combined through the proposed cyclic fitness assignment mechanism. Experiments are conducted on a public benchmark problem set, and the results show that the proposed algorithm outperforms the existing ones.

Benchmark instances

http://cobweb.ecn.purdue.edu/~uzsoy2/benchmark/jlmax.txt

Benchmark approaches

C.M. Fonseca and P.J. Fleming, Genetic algorithms for multiobjective optimization: formulation, discussion and generalization, Proc. of the Fifth International Conference on Genetic Algorithms, 1993.

K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, A fast and elitist multi-objective genetic algorithm: NSGA-II, IEEE Trans. on Evolutionary Computation, vol. 6, no. 2, pp. 181 – 197, 2002.

E. Zitzler, M. Laumanns, and L. Thiele, SPEA2: Improving the strength Pareto evolutionary algorithm, Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland, May 2001.

Google scholar cites: 4