Tabu search heuristic for two-machine flowshop with batch processing machines

Batch processing machines are frequently encountered in many industrial environments. A batch processing machine is one which can process several jobs simultaneously as a batch. The processing time of a batch is equal to the largest processing time of any job in the batch. This study deals with the problem of scheduling jobs in a flowshop with two batch processing machines such that the makespan is minimized. A heuristic based on Tabu search (TS) technique is proposed. The proposed heuristic is compared with a heuristic based on mixed integer linear programming (MILP). Because the complexity of the MILP-based heuristic is depended on the number of job batches, the comparison is under up-to-eight batches problem. In order to measure the proposed TS-based heuristic in larger batch problem, the relative error percentage with the lower bound (REP"L"B) is used. The results show that the proposed heuristic is efficient and effective for the problems with relative large job sizes.

[1]  Ching-Jong Liao,et al.  Improved MILP models for two-machine flowshop with batch processing machines , 2008, Math. Comput. Model..

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

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

[4]  William B. Carlton,et al.  A note on hashing functions and tabu search algorithms , 1996 .

[5]  D. J. van der Zee,et al.  Dynamic scheduling of batch-processing machines with non-identical product sizes , 2007 .

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

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

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

[9]  Purushothaman Damodaran,et al.  Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing , 2009 .

[10]  Young Hwan Kim,et al.  Minimizing due date related performance measures on two batch processing machines , 2003, Eur. J. Oper. Res..

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

[12]  L. Su.  A hybrid two-stage flowshop with limited waiting time constraints , 2003 .

[13]  David L. Woodruff,et al.  Hashing vectors for tabu search , 1993, Ann. Oper. Res..

[14]  J. A. Hoogeveen,et al.  Scheduling a batching machine , 1998 .

[15]  Gregory Dobson,et al.  The Batch Loading and Scheduling Problem , 2001, Oper. Res..

[16]  Reha Uzsoy,et al.  Scheduling a single batch processing machine with secondary resource constraints , 1998 .

[17]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[18]  John W. Fowler,et al.  Minimizing total weighted tardiness on a single batch process machine with incompatible job families , 2005, Comput. Oper. Res..

[19]  Purushothaman Damodaran,et al.  Mixed integer formulation to minimize makespan in a flow shop with batch processing machines , 2004, Math. Comput. Model..

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