Parallel batching problems
n jobs have to be processed in batches on a single machine. A batch
consists of maximal b jobs. We distinguish the bounded (b<n) and
the unbounded case. All jobs in a batch start and complete
at the same time. The processing time of a batch is equal to the
largest processing time of any job in the batch.