Scheduling a Batching Machine

摘要

The authors address the problem of scheduling n jobs on a batching machine to211u001eminimize regular scheduling criteria that are non-decreasing in the job 211u001ecompletion times. A batching machine is a machine that can handle up to b jobs 211u001esimultaneously. The jobs that are processed together form a batch, and all jobs 211u001ein a batch start and complete at the same time. The processing time of a batch is 211u001eequal to the largest processing time of any job in the batch. The authors analyze 211u001etwo variants: The unbounded model, where b > or = n; and the bounded model, where 211u001eb < or = n.