Abstract:

The due window situation is combined with the conception of batch so that the jobs can be processed in batches on a single machine. To minimize the weighted number of early and tardy jobs, the batch is bounded and all the jobs share a common due window［e, d］. Further, the location and size of the due window are decision variables, and the optimal sequence is determined. An efficient algorithm is proposed with several optimal properties.

Key words: batch; due window; earliness; tardiness