Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes

摘要

Problems of minimizing makespan in scheduling batch processing machines are widely exploited by academic literature, mainly motivated by burn-in tests in the semiconductor industry. The problem addressed in this work consists of grouping jobs into batches and scheduling them in parallel machines. The jobs have non-identical size and processing times. The total size of the batch cannot exceed the capacity of the machine. The processing time of each batch will be equal to the longest processing time among all the jobs assigned to it. This paper proposes an arc-flow based model for minimizing makespan on parallel processing machines P_m|S_j, B|C_(max). The mathematical model is solved using CPLEX, and computational results show that the proposed models have a better performance than other models in the literature.