Abstract
Multiobjective evolutionary algorithm (MOEA) has attracted much attention in the past decade; however, the application of MOEA to practical problems such as job shop scheduling is seldom considered. In this paper, crowding-measure-based multiobjective evolutionary algorithm (CMOEA) is first designed, which makes use of the crowding measure to adjust the external population and assign different fitness for individuals; then CMOEA is applied to job shop scheduling to minimize makespan and the total tardiness of jobs. Finally, the comparison between CMOEA and SPEA demonstrates that CMOEA performs well in job shop scheduling.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Proc lst international conference on genetic algorithm, Lawrence Erlbaum Associates, Hillsdale, pp 93–100
Van Veldhuizen DA, Lamont GB (2000) Multiobjective evolutionary algorithms: analyzing the state-of-the-art. Evol Comput 8(2):125–147
Knowles JD, Corne DW (2000) Approximating the nondominated front using the Pareto archive evolutionary strategy. Evol Comput 8(2):149–172
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
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
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)
Srinivas N, Deb K (1994) Multiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221–248
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
Lu H, Yen GG (2003) Rank-density-based multiobjective genetic algorithm and benchmark test function study. IEEE Trans Evol Comput 7(4):325–343
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
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
Ponnambalam SG, Ramkumar V, Jawahar N (2001) A multi-objective genetic algorithm for job shop scheduling. Prod Plan Control 12(8):764–774
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
Knowles J, Corne D (2003) Properties of an adapative archiving algorithm for storing nondominated vectors. IEEE Trans Evol Comput 7(2):100–116
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lei, D., Wu, Z. Crowding-measure-based multiobjective evolutionary algorithm for job shop scheduling. Int J Adv Manuf Technol 30, 112–117 (2006). https://doi.org/10.1007/s00170-005-0029-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-005-0029-6