Integrated production and delivery on parallel batching machines
The problem of scheduling n jobs on m parallel batching machines is considered. The goal is to maximize the total profit earned. We show that the problem can be solved efficiently if each job has the same size. The problem becomes unary NP-hard if the jobs have different sizes. For the NP-hard cases, heuristics are given and their performance analyzed.
parallel batching machines np-hard heuristics coordinated production-delivery fixed time departure