Optimising batch scheduling on non-identical parallel machines: lower bounds, MIP, branch-and-price, and heuristics

This paper addresses a scheduling problem involving a set of diverse jobs processed in batches. Each job has its own processing time and size. Notably, the processing time of any batch is determined by the longest processing time among the jobs it contains. These batches are scheduled on parallel machines with non-identical capacities, ensuring that the total size of the jobs in any batch does not exceed the capacity of the assigned machine. …