Minimizing the earliness and tardiness penalty with batch processing
最小化提前和延误惩罚的批处理问题

The common due-window scheduling problem is concerned with the batching for minimizing the weighted earliness-and-tardiness penalties, where the jobs share a common due-window e; d]. We combine the due-window situation with the concept of batch where considering job processing in batches. The bounded version of batch scheduling is considered such that at most b jobs can be processed in a batch with b < n, the number of jobs. Furthermore, the location and size of due-window are given parametrically. The problem is NP-complete. Based on optimal properties, two special cases are discussed.