An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times

Abstract This paper investigates the problem of scheduling a set of jobs with arbitrary sizes and non-zero release times on a set of unrelated parallel batch machines with different capacities so as to minimize the total flow time of the jobs. The total flow time, defined as the total amount of time that the jobs spend in the system (i.e. the period between the job release dates and its completion times), is one of the most important objectives in scheduling problems, since it can lead to stable utilization of resources and reduction of working-in-process inventory. Motivated by the computational complexity of the problem, a simple and effective iterated greedy (IG) algorithm is proposed to solve it. The IG algorithm uses an efficient greedy heuristic to reconstruct solutions and a local search procedure to further enhance the solution quality. In attempting to obtain optimal solutions for small-medium size instances, a mixed integer programming model for the problem is also presented. The performance of the proposed algorithm is tested on a comprehensive set of small, medium and large benchmark of randomly generated instances, and is compared to three benchmark meta-heuristic algorithms (Discrete Differential Evolution, Ant Colony Optimization and Simulated Annealing) recently proposed for similar parallel batch machine scheduling problems. Experimental results and statistical tests show that the proposed algorithm is significantly superior in performance than the other algorithms.

[1]  Reza Tavakkoli-Moghaddam,et al.  Solving a bi-objective unrelated parallel batch processing machines scheduling problem: A comparison study , 2017, Comput. Oper. Res..

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

[3]  Xiaolin Li,et al.  Scheduling unrelated parallel batch processing machines with non-identical job sizes , 2013, Comput. Oper. Res..

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

[5]  Pyung-Hoi Koo,et al.  Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families , 2004 .

[6]  Celso C. Ribeiro,et al.  TTT plots: a perl program to create time-to-target plots , 2007, Optim. Lett..

[7]  Joseph Y.-T. Leung,et al.  An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times , 2017, Comput. Ind. Eng..

[8]  D. Gong,et al.  Solving the blocking flow shop scheduling problem with makespan using a modified fruit fly optimisation algorithm , 2016 .

[9]  Chengbin Chu.  Efficient heuristics to minimize total flow time with release dates , 1992, Oper. Res. Lett..

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

[11]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[12]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[13]  Shanlin Yang,et al.  An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizes , 2013, Appl. Soft Comput..

[14]  M. Mathirajan,et al.  A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor , 2006 .

[15]  Lars Mönch,et al.  Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics , 2014, Comput. Ind. Eng..

[16]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[17]  Ali Husseinzadeh Kashan,et al.  A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes , 2008, Comput. Oper. Res..

[18]  Marcus Ritt,et al.  Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops , 2016, Comput. Oper. Res..

[19]  Quan-Ke Pan,et al.  An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem , 2014 .

[20]  Fuh-Der Chou,et al.  Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics , 2010, Expert Syst. Appl..

[21]  Purushothaman Damodaran,et al.  Heuristics to minimize makespan of parallel batch processing machines , 2008 .

[22]  John W. Fowler,et al.  Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times , 2005, Comput. Oper. Res..

[23]  Xiao-Yan Sun,et al.  A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking , 2015 .

[24]  Rasaratnam Logendran,et al.  A bi-objective batch processing problem with dual-resources on unrelated-parallel machines , 2017, Appl. Soft Comput..

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

[26]  Rui Xu,et al.  A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system , 2013 .

[27]  Shanlin Yang,et al.  Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes , 2012 .

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

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

[30]  Makespan minimisation on parallel batch processing machines with non-identical job sizes and release dates , 2012 .

[31]  Li-Chen Fu,et al.  A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival , 2010, Comput. Oper. Res..

[32]  Reha Uzsoy,et al.  Scheduling batch processing machines with incompatible job families , 1995 .

[33]  Hamed Fazlollahtabar,et al.  Bi-objective optimisation for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limits , 2015 .

[34]  Feng Li,et al.  Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations , 2014 .

[35]  J. Leung,et al.  Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan , 2014 .

[36]  Purushothaman Damodaran,et al.  A GRASP approach for makespan minimization on parallel batch processing machines , 2011, J. Intell. Manuf..

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

[38]  Joseph Y.-T. Leung,et al.  A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes , 2015, Eur. J. Oper. Res..

[39]  Shengchao Zhou,et al.  An effective discrete differential evolution algorithm for scheduling uniform parallel batch processing machines with non-identical capacities and arbitrary job sizes , 2016 .

[40]  Joseph Y.-T. Leung,et al.  Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times , 2017, Comput. Oper. Res..

[41]  Joseph Y.-T. Leung,et al.  An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families , 2016, Appl. Soft Comput..

[42]  Andreas Klemmt,et al.  A comparison of MIP-based decomposition techniques and VNS approaches for batch scheduling problems , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

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

[44]  Vinícius Amaral Armentano,et al.  Genetic local search for multi-objective flowshop scheduling problems , 2005, Eur. J. Oper. Res..

[45]  Omar Ghrayeb,et al.  A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines , 2012 .

[46]  John W. Fowler,et al.  A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations , 2011, J. Sched..

[47]  James C. Bean,et al.  A Genetic Algorithm for Scheduling Parallel Non-identical Batch Processing Machines , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[48]  Purushothaman Damodaran,et al.  Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times , 2010 .

[49]  Sharif H. Melouk,et al.  Minimizing makespan on parallel batch processing machines , 2004 .

[50]  Xiaolin Li,et al.  Heuristics to schedule uniform parallel batch processing machines with dynamic job arrivals , 2013, Int. J. Comput. Integr. Manuf..

[51]  Joseph Y.-T. Leung,et al.  Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities , 2017, Future Gener. Comput. Syst..

[52]  Christian Blum,et al.  An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem , 2013, Comput. Oper. Res..

[53]  M. Mathirajan,et al.  Minimizing total weighted tardiness on heterogeneous batch processing machines with incompatible job families , 2006 .

[54]  M. Mathirajan,et al.  Minimizing total weighted tardiness on heterogeneous batch processors with incompatible job families , 2014 .

[55]  Joseph Y.-T. Leung,et al.  Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities , 2015 .

[56]  Shih-Wei Lin,et al.  Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic , 2009, Expert Syst. Appl..