Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection

In this paper we study a single batch-processing machine scheduling model. In our model, a set of jobs having different release dates needs to be scheduled onto a single machine that can process a batch of jobs simultaneously at a time. Each batch incurs a fixed setup time and a fixed setup cost. Th...

Celý popis