Batch Scheduling Problem and Algorithm on Parallel Machines with Time Bound

We consider the problem of batch scheduling jobs on m parallel machines with time bound to minimize total weighted completion times. Each batching machine can processing to b jobs simultaneously as a batch. A polynomial-time optimal algorithm for identical job processing time model is presented whose details and proof are given.