Crowding-measure-based multiobjective evolutionary algorithm for job shop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 30, Issue 1-2, 2006, Pages 112-117

  Lei, Deming ^a   Wu, Zhiming ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Crowding measure; Job shop scheduling; Multiobjective evolutionary algorithm

Indexed keywords

JOB ANALYSIS; PROBLEM SOLVING; SCHEDULING;

CROWDING MEASURE; JOB SHOP SCHEDULING; MULTIOBJECTIVE EVOLUTIONARY ALGORITHMS;

EVOLUTIONARY ALGORITHMS;

EID: 33746788617     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-005-0029-6     Document Type: Article

References (14)

1. Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Proc 1st international conference on genetic algorithm, Lawrence Erlbaum Associates, Hillsdale, pp 93-100
2. Van Veldhuizen DA, Lamont GB (2000) Multiobjective evolutionary algorithms: analyzing the state-of-the-art Evol Comput 8(2):125-147
3. Knowles JD, Corne DW (2000) Approximating the nondominated front using the Pareto archive evolutionary strategy. Evol Comput 8(2):149-172
4. Knowles JD, Corne DW (2000) M-PAES: a memetic algorithm for multiobjective optimization. In: Proceedings of the IEEE Conference on Evolutionary Computation, ICEC 1:325-332
5. Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257-271
6. Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength Pareto evolutionary algorithm. Swiss Federal Institute of Technology, Lausanne, Switzerland, pp 103 (Tech. Rep. TIK-Rep)
7. Srinivas N, Deb K (1994) Multiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2 (3):221-248
8. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithms: NSGA. IEEE Trans Evol Comput 6(2):182-197
9. Lu H, Yen GG (2003) Rank-density-based multiobjective genetic algorithm and benchmark test function study. IEEE Trans Evol Comput 7(4):325-343
10. Sridhar J, Rajendran CS (1996) Scheduling in flow shop and cellular manufacturing with multiple objectives a genetic algorithm approach. Prod Plan Control 7(4):374-382
11. Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flow shop scheduling. IEEE Trans Syst, Man Cybern: Part C 28(3):392-403
12. Ponnambalam SG, Ramkumar V, Jawahar N (2001) A multi-objective genetic algorithm for job shop scheduling. Prod Plan Control 12(8):764-774
13. Kacem I, Hammadi S, Borne P (2002) Pareto-optimality approach for flexible job shop scheduling problems: hybridization of evolutionary algorithm and fuzzy logic. Math Comput Simul 60:245-276
14. Knowles J, Corne D (2003) Properties of an adapative archiving algorithm for storing nondominated vectors. IEEE Trans Evol Comput 7(2):100-116