A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan

In this work, a discrete version of PSO algorithm is proposed to minimize the makespan of a job-shop. A novel schedule builder has been utilized to generate active schedules. The discrete PSO is tested using well known benchmark problems available in the literature. The solution produced by the proposed algorithms is compared with best known solution published in the literature and also compared with hybrid particle swarm algorithm and variable neighborhood search PSO algorithm. The solution construction methodology adopted in this study is found to be effective in producing good quality solutions for the various benchmark job-shop scheduling problems.

[1]  Prakash Marimuthu,et al.  Simulation modelling and development of analytic hierarchy process-based priority dispatching rule for a dynamic press shop , 2017 .

[2]  K. Rameshkumar,et al.  Application of particle swarm intelligence algorithms in supply chain network architecture optimization , 2012, Expert Syst. Appl..

[3]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[4]  Chandrasekharan Rajendran,et al.  Discrete particle swarm optimisation algorithms for minimising the completion-time variance of jobs in flowshops , 2011 .

[5]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[6]  Albert Jones,et al.  Survey of Job Shop Scheduling Techniques , 1999 .

[7]  Chandrasekharan Rajendran,et al.  New dispatching rules for scheduling in a job shop — An experimental study , 1997 .

[8]  Chandrasekharan Rajendran,et al.  Neighborhood Search Assisted Particle Swarm Optimization (NPSO) Algorithm for Partitional Data Clustering Problems , 2011, ACC.

[9]  Weijun Xia,et al.  A hybrid particle swarm optimization approach for the job-shop scheduling problem , 2006 .

[10]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[11]  Mitsuo Gen,et al.  Solving job-shop scheduling problems by genetic algorithm , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[12]  Hao Gao,et al.  A Hybrid Particle-Swarm Tabu Search Algorithm for Solving Job Shop Scheduling Problems , 2014, IEEE Transactions on Industrial Informatics.

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

[14]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Kenneth N. McKay,et al.  Job-Shop Scheduling Theory: What Is Relevant? , 1988 .

[17]  Jacek Blazewicz,et al.  Handbook on Scheduling: From Theory to Applications , 2014 .

[18]  Chandrasekharan Rajendran,et al.  A novel particle swarm optimisation algorithm for continuous function optimisation , 2012 .

[19]  Sheik Meeran,et al.  A State-of-the-art Review of Job-Shop Scheduling Techniques , 2017 .

[20]  R. K. Suresh,et al.  Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan , 2005, ICNC.

[21]  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..

[22]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[23]  Yun-Chia Liang,et al.  A Particle Swarm Optimization and Differential Evolution Algorithms for Job Shop Scheduling Problem , 2006 .