Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing

This research proposes a simulated annealing (SA) approach to minimize makespan for a single batch-processing machine. Each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the machine capacity is not exceeded. The processing time of a batch is equal to the longest processing time among all jobs in the batch. Random instances were generated to test our approach with respect to solution quality and run time. The results of the SA approach were compared to CPLEX. Our approach outperforms CPLEX on all the instances.