REN, JIANFENG; ZHANG, YUZHONG; SUN, GUO - In: Asia-Pacific Journal of Operational Research (APJOR) 26 (2009) 03, pp. 351-363
We consider the problem of minimizing the total late work $(\sum_{j=1}^{n}\, V_j)$ on an unbounded batch processing machine, where Vj = min {Tj, pj} and Tj = max {Cj - dj, 0}. The batch processing machine can process up to B (B ≥ n) jobs simultaneously. The jobs that are processed together...