Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families

We study the scheduling problem of minimising weighted completion times on parallel identical batching machines with dynamic job arrivals and incompatible job families. Each job is associated with a family, weight (priority), release time, and size. Batching machines can process simultaneously up to a specified total size of the jobs of a particular family. The scheduling problem can be represented by . We present a mathematical model and heuristic algorithms employing different local search procedures individually and sequentially under a variable neighbourhood search scheme. We have shown that among local searches, repositioning the batches instead of jobs yields better results. The best-performing heuristic algorithm is capable of generating solutions within 0.6% of the best overall heuristic solution for each instance in a reasonable amount of time. When this heuristic is compared against the mathematical model, solutions that are 3.7% above optimal on average in the 15-job problem instances are possible.

[1]  Meral Azizoglu,et al.  Scheduling a batch processing machine with incompatible job families , 2001 .

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

[3]  Ahmet B. Keha,et al.  Mixed integer programming formulations for single machine scheduling problems , 2009, Comput. Ind. Eng..

[4]  Marc E. Posner,et al.  Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures , 2007, Oper. Res..

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

[6]  Y. H. Kim,et al.  Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals , 2002, Comput. Oper. Res..

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

[8]  John W. Fowler,et al.  Real-time control of multiproduct bulk-service semiconductor manufacturing processes , 1992 .

[9]  Bahman Naderi,et al.  A Variable Neighborhood Search for Hybrid Flexible Flowshops with Setup Times Minimizing Total Completion Time , 2008 .

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

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

[12]  T.C.E. Cheng,et al.  Single machine batch scheduling with sequential job processing , 2001 .

[13]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[14]  Scott J. Mason,et al.  Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems , 2010, Comput. Ind. Eng..

[15]  Scott J. Mason,et al.  Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times , 2008 .

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

[17]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

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

[19]  John W. Fowler,et al.  Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness , 2004 .

[20]  Scott J. Mason,et al.  Multiple orders per job batch scheduling with incompatible jobs , 2008, Ann. Oper. Res..

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

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

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