There are n workpieces to be processed at time zero. The length of time needed for processing them varies with each workpiece. The workpieces are divided into b batches, and all the workpieces in the same batch must be processed together, successively or at the same time. The problem under consideration is to minimize the range of lateness. To solve such a scheduling problem, this paper determines some properties and constructs corresponding pseudopolynomial algorithms.
