Multi-objective DE and PSO strategies for production scheduling

This paper investigates the application of alternative multi-objective optimization (MOO) strategies to a complex scheduling problem. Two vector evaluated algorithms, namely the vector evaluated particle swarm optimization (VEPSO) algorithm as well as the vector evaluated differential evolution (VEDE) algorithm is compared to a differential evolution based modified goal programming approach. This paper is considered significant since no other reference to the application of vector evaluated algorithms in a scheduling environment could be found. Algorithm performance is evaluated on real customer data and meaningful conclusions are drawn with respect to the application of MOO algorithms in a multiple machine multi-objective scheduling environment.

[1]  Zhang Wei,et al.  A new hybrid optimization algorithm for the job-shop scheduling problem , 2004, Proceedings of the 2004 American Control Conference.

[2]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[3]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[4]  M Reyes Sierra,et al.  Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art , 2006 .

[5]  A. Engelbrecht,et al.  A new locally convergent particle swarm optimiser , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[6]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[7]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[8]  Jacques Carlier,et al.  Handbook of Scheduling - Algorithms, Models, and Performance Analysis , 2004 .

[9]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[10]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[11]  Arthur C. Sanderson,et al.  Pareto-based multi-objective differential evolution , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[12]  Qiang Zhou,et al.  A hybrid optimization algorithm for the job-shop scheduling problem , 2009, GEC '09.

[13]  R. Saravanan,et al.  Scheduling optimisation of flexible manufacturing systems using particle swarm optimisation algorithm , 2005 .

[14]  Mitsuo Gen,et al.  A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems , 2007, Comput. Ind. Eng..

[15]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[16]  Yaochu Jin,et al.  Dynamic Weighted Aggregation for evolutionary multi-objective optimization: why does it work and how? , 2001 .

[17]  Mitsuo Gen,et al.  Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem , 2009 .

[18]  Xiaodong Li,et al.  Particle swarm optimization-based schemes for resource-constrained project scheduling , 2005 .

[19]  Taïcir Loukil,et al.  A multi-objective production scheduling case study solved by simulated annealing , 2007, Eur. J. Oper. Res..

[20]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[21]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[22]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[23]  J. C. Bean,et al.  A GENETIC ALGORITHM METHODOLOGY FOR COMPLEX SCHEDULING PROBLEMS , 1999 .

[24]  K..  Multiobjective Optimization Using a Pareto Differential Evolution Approach , 2022 .

[25]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[26]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[27]  M. N. Vrahatis,et al.  Particle swarm optimization method in multiobjective problems , 2002, SAC '02.

[28]  N. Madavan.  Multiobjective optimization using a Pareto differential evolution approach , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[29]  Andries Petrus Engelbrecht,et al.  A starting-time-based approach to production scheduling with Particle Swarm Optimization , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[30]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[31]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[32]  Joshua D. Knowles.  Local-search and hybrid evolutionary algorithms for Pareto optimization , 2002 .

[33]  Dimitris K. Tasoulis,et al.  Vector evaluated differential evolution for multiobjective optimization , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[34]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[35]  James C. Bean,et al.  Matchup Scheduling with Multiple Resources, Release Dates and Disruptions , 1991, Oper. Res..

[36]  H. Abbass,et al.  PDE: a Pareto-frontier differential evolution approach for multi-objective optimization problems , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[37]  Bin Jiao,et al.  A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan , 2006, Appl. Math. Comput..