A Multi-objective PSO for job-shop scheduling problems

Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most production systems requires multi-objective optimization. The aim of this paper is to construct a particle swarm optimization (PSO) for an elaborate multi-objective job-shop scheduling problem. The original PSO was used to solve continuous optimization problems. Due to the discrete solution spaces of scheduling optimization problems, the authors modified the particle position representation, particle movement, and particle velocity in this study. The modified PSO was used to solve various benchmark problems. Test results demonstrated that the modified PSO performed better in search quality and efficiency than traditional evolutionary heuristics.

[1]  N. Jawahar,et al.  A multiobjective genetic algorithm for job shop scheduling , 2001 .

[2]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[3]  Helena Ramalhinho Dias Lourenço,et al.  Job-shop scheduling: Computational study of local search and large-step optimization methods , 1995 .

[4]  Yanchun Liang,et al.  A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS , 2005 .

[5]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[6]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[7]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[8]  R. Suresh,et al.  Pareto archived simulated annealing for job shop scheduling with multiple objectives , 2006 .

[9]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

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

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

[12]  Local Optimization and the Job-shop Scheduling Problem , 1994 .

[13]  Li Lin,et al.  Effective job shop scheduling through active chain manipulation , 1995, Comput. Oper. Res..

[14]  Susana C. Esquivel,et al.  Parameter Settings and Representations in Pareto-Based Optimization for Job Shop Scheduling , 2002, Cybern. Syst..

[15]  M. A. B. Candido,et al.  A genetic algorithm based procedure for more realistic job shop scheduling problems , 1998 .

[16]  D. Y. Sha,et al.  A new particle swarm optimization for the open shop scheduling problem , 2008, Comput. Oper. Res..

[17]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

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

[19]  Isao Ono,et al.  An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.

[20]  Kazi Shah Nawaz Ripon.  Hybrid Evolutionary Approach for Multi-Objective Job-Shop Scheduling Problem , 1970 .

[21]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[22]  Deming Lei,et al.  A Pareto archive particle swarm optimization for multi-objective job shop scheduling , 2008, Comput. Ind. Eng..

[23]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[24]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[25]  Lei De.  Crowding-Measure Based Multi-Objective Evolutionary Algorithm , 2005 .

[26]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[27]  D. Y. Sha,et al.  A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..

[28]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .