Modelling and symmetry breaking in scheduling problems on batch processing machines

Problems of scheduling batch-processing machines to minimise the makespan are widely exploited in the literature, mainly motivated by real-world applications, such as burn-in tests in the semiconductor industry. These problems consist of grouping jobs in batches and scheduling them on machines. We consider problems where jobs have non-identical sizes and processing times, and the total size of each batch cannot exceed the machine capacity. The processing time of a batch is defined as the longest processing time among all jobs assigned to it. Jobs can also have non-identical release times, and in this case, a batch can only be processed when all jobs assigned to it are available. This paper discusses four different versions of batch scheduling problems, considering a single processing machine or parallel processing machines and considering jobs with or without release times. New mixed integer linear programming formulations are proposed as enhancements of formulations proposed in the literature, and symmetry breaking constraints are investigated to reduce the size of the feasible sets. Computational results show that the proposed formulations have a better performance than other models in the literature, being able to solve to optimality instances only considered before to be solved by heuristic procedures.

[1]  Guochuan Zhang,et al.  Minimizing makespan on a single batch processing machine with nonidentical job sizes , 2001 .

[2]  Muhammad Al-Salamah,et al.  Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes , 2015, Appl. Soft Comput..

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

[4]  Fariborz Jolai,et al.  Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes , 2006 .

[5]  Purushothaman Damodaran,et al.  Algorithms for scheduling parallel batch processing machines with non-identical job ready times , 2009 .

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

[7]  Ali Husseinzadeh Kashan,et al.  A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes , 2010, Comput. Oper. Res..

[8]  P. Chang,et al.  A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem , 2006 .

[9]  Lionel Dupont,et al.  Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes , 1998 .

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

[11]  Young Hoon Lee,et al.  Minimising makespan heuristics for scheduling a single batch machine processing machine with non-identical job sizes , 2013 .

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

[13]  Omar Ghrayeb,et al.  GRASP to minimize makespan for a capacitated batch-processing machine , 2013 .

[14]  Rui Xu,et al.  Makespan minimization on single batch-processing machine via ant colony optimization , 2012, Comput. Oper. Res..

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

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

[17]  Purushothaman Damodaran,et al.  Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms , 2009 .

[18]  Marcia Fampa,et al.  Mixed-Integer Linear Programming Formulations for the Software Clustering Problem , 2013, Comput. Optim. Appl..

[19]  Rui Xu,et al.  Minimising makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes , 2014 .

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

[21]  Ying Meng,et al.  A tabu search heuristic to solve the scheduling problem for a batch-processing machine with non-identical job sizes , 2010, 2010 International Conference on Logistics Systems and Intelligent Management (ICLSIM).

[22]  George Q. Huang,et al.  Scheduling a batch processing machine with non-identical job sizes: a clustering perspective , 2011 .

[23]  François Margot,et al.  Symmetry in Integer Linear Programming , 2010, 50 Years of Integer Programming.

[24]  Purushothaman Damodaran,et al.  Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms , 2006 .

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

[26]  Lionel Dupont,et al.  Minimizing makespan on a single batch processing machine with non-identical job sizes , 1998 .

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