The NP-Hardness of Minimizing the Total Late Work on an Unbounded Batch Machine

@article{Ren2009TheNO,
  title={The NP-Hardness of Minimizing the Total Late Work on an Unbounded Batch Machine},
  author={Jianfeng Ren and Yuzhong Zhang and Guo Sun},
  journal={APJOR},
  year={2009},
  volume={26},
  pages={351-363}
}
We consider the problem of minimizing the total late work ( n ∑ j=1 V j) on an unbounded batch processing machine, where V j = min{Tj, p j} and Tj = max{C j−d j,0}. The batch processing machine can process up to B (B≥ n) jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time… CONTINUE READING