A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
We address a batch scheduling problem of n identical processing time jobs on an m-machine flow-shop and a 2-machine job-shop. The objective is makespan minimization. Both problems are shown to be solved in O(n).
flow-shop job-shop batch scheduling makespan