Minimizing makespan on parallel batch processing machines

Abstract

A simulated annealing approach to minimize makespan for identical parallel batch-processing machines is presented. Each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the total size of all the jobs in a batch does not exceed the machine capacity. The processing time of a batch is equal to the longest processing time among all the jobs in the batch. Random instances were generated to test the approach with respect to solution quality and run time. The results of the simulated annealing approach were compared with CPLEX. The approach outperforms CPLEX on most of the instances.