A modified particle swarm optimization algorithm for a batch-processing machine scheduling problem with arbitrary release times and non-identical job sizes

Abstract This paper presents a modified particle swarm optimization (MPSO) algorithm to minimize the maximum lateness for the single batch-processing machine problem with non-identical job sizes and release dates. The MPSO algorithm incorporated a diversification and a local search strategy into a basic particle swarm optimization algorithm. This incorporation enables the proposed algorithm to have a good balance between exploration and exploitation that yields high search efficiency. Additionally, a dynamic programming method is proposed to calculate a relevant value for each particle. The MPSO algorithm was tested in problems from the literature without release dates and newly generated problems with release dates. Computational results show the advantages of combining the diversification strategy, and local search methods. The performance of the proposed MPSO is competitive. For the problems without release dates, the MPSO algorithm could find 80 optimal solutions and improve 68 solutions for all benchmark instances. For the problems with job release dates, the MPSO algorithm also significantly outperformed the other two algorithms with respect to solution quality within the same computational time.

[1]  Clarisse Dhaenens,et al.  Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure , 2002, Comput. Oper. Res..

[2]  Yoshiro Ikura,et al.  Efficient scheduling algorithms for a single batch processing machine , 1986 .

[3]  Reha Uzsoy,et al.  Minimizing total completion time on batch processing machines , 1993 .

[4]  Fariborz Jolai,et al.  Minimizing number of tardy jobs on a batch processing machine with incompatible job families , 2005, Eur. J. Oper. Res..

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

[6]  Lars Mönch,et al.  Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date , 2007, Comput. Oper. Res..

[7]  Christelle Guéret,et al.  A Branch-and-Price algorithm to minimize the maximum lateness on a batch processing machine , 2008 .

[8]  Louis-Martin Rousseau,et al.  A constraint programming approach for a batch processing problem with non-identical job sizes , 2012, Eur. J. Oper. Res..

[9]  Ruey-Maw Chen,et al.  Using novel particle swarm optimization scheme to solve resource-constrained scheduling problem in PSPLIB , 2010, Expert Syst. Appl..

[10]  Massimo Paolucci,et al.  A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times , 2009, Eur. J. Oper. Res..

[11]  Reha Uzsoy,et al.  Minimizing makespan on a single batch processing machine with dynamic job arrivals , 1999 .

[12]  R. Uzsoy.  Scheduling a single batch processing machine with non-identical job sizes , 1994 .

[13]  Wen Lea Pearn,et al.  Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes , 2009 .

[14]  C. S. Sung,et al.  Minimizing makespan on a single burn-in oven in semiconductor manufacturing , 2000, Eur. J. Oper. Res..

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

[16]  Reha Uzsoy,et al.  A genetic algorithm to minimize maximum lateness on a batch processing machine , 2002, Comput. Oper. Res..

[17]  Purushothaman Damodaran,et al.  A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times , 2012, Expert Syst. Appl..

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

[19]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

[20]  Ling Wang,et al.  An effective hybrid particle swarm optimization for no-wait flow shop scheduling , 2007 .

[21]  Reha Uzsoy,et al.  A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families , 2007, Comput. Oper. Res..

[22]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[23]  Chung-Lun Li,et al.  Scheduling with agreeable release times and due dates on a batch processing machine , 1997 .

[24]  Reha Uzsoy,et al.  Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..

[25]  Xiaoli Wang,et al.  Minimizing makespan on a single batching machine with release times and non-identical job sizes , 2005, Oper. Res. Lett..

[26]  Nasser Salmasi,et al.  Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem , 2013, Comput. Ind. Eng..

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

[28]  Purushothaman Damodaran,et al.  Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing , 2004 .

[29]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[30]  Ching-Jen Huang,et al.  Tabu search heuristic for two-machine flowshop with batch processing machines , 2011, Comput. Ind. Eng..

[31]  F. Jolai,et al.  Optimal methods for batch processing problem with makespan and maximum lateness objectives , 2010 .

[32]  Chris N. Potts,et al.  Split-merge: Using exponential neighborhood search for scheduling a batching machine , 2015, Comput. Oper. Res..

[33]  Shuguang Li,et al.  Minimizing makespan with release times on identical parallel batching machines , 2005, Discret. Appl. Math..

[34]  Purushothaman Damodaran,et al.  Scheduling a capacitated batch-processing machine to minimize makespan , 2007 .

[35]  M. Dessouky.  Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness , 1998 .

[36]  Mehmet Fatih Tasgetiren,et al.  Particle swarm optimization algorithm for single machine total weighted tardiness problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).