The burn-in test scheduling problem with batch dependent processing time and sequence dependent setup time

The burn-in test scheduling problem (BTSP) is a variation of the complex batch processing machine scheduling problem, which is also a generalisation of the liquid crystal injection scheduling problem with incompatible product families and classical identical parallel machine problem. In the case we investigated on the BTSP, the jobs are clustered by their product families. The product families can be clustered by different product groups. In the same product group, jobs with different product families can be processed as a batch. The batch processing time is dependent on the longest processing time of those jobs in that batch. Setup times between two consecutive batches of different product groups on the same batch machine are sequentially dependent. In addition, the unequal ready times are considered in the BTSP which involves the decisions of batch formation and batch scheduling in order to minimise the total machine workload without violating due dates and the limited machine capacity restrictions. Since the BTSP involves constraints on unequal ready time, batch dependent processing time, and sequence dependent setup times, it is more difficult to solve than the classical parallel batch processing machine scheduling problem with compatible product families or incompatible product families. These restrictions mean that the existing methods cannot be applied into real-world factories directly. Consequently, this paper proposes a mixed integer programming model to solve the BTSP exactly. In addition, two efficient solution procedures which solve the BTSP are also presented.

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

[2]  Shu-Hsing Chung,et al.  Minimizing the total machine workload for the wafer probing scheduling problem , 2002 .

[3]  W. L. Pearna,et al.  A case study on the multistage IC final testing scheduling problem with reentry , 2004 .

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

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

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

[7]  Reha Uzsoy,et al.  Minimizing total tardiness on a batch processing machine with incompatible job families , 1998 .

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

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

[10]  Mary E. Kurz,et al.  A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families , 2006 .

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

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

[13]  Lars Mönch,et al.  Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines , 2006, Eng. Appl. Artif. Intell..

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

[15]  Pyung-Hoi Koo,et al.  Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families , 2005 .

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

[17]  Pedro M. Castro,et al.  Scheduling multistage batch plants with sequence‐dependent changeovers , 2009 .

[18]  Bruce L. Golden,et al.  Evaluating a Sequential Vehicle Routing Algorithm , 1977 .

[19]  W L Pearn,et al.  Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions , 2004, J. Oper. Res. Soc..

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

[21]  Fuh-Der Chou,et al.  A HYBRID FORWARD/BACKWARD APPROACH FOR SINGLE BATCH SCHEDULING PROBLEMS WITH NON-IDENTICAL JOB SIZES , 2007 .

[22]  D. J. van der Zee.  Dynamic scheduling of batch servers with compatible product families , 2004 .

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

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

[25]  V. Erramilli,et al.  Multiple Orders Per Job Compatible Batch Scheduling , 2006, IEEE Transactions on Electronics Packaging Manufacturing.

[26]  W. Pearn,et al.  Minimizing the total machine workload for the wafer probing scheduling problem , 2002 .

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

[28]  Chun-Mei Lai,et al.  The liquid crystal injection scheduling problem (LCISP) , 2011 .