One can describe late work as “the number of tardy job units” (see [3]). Potts and Van Wassenhove [5] provided the most significant results in scheduling with total late work: they proved NP-hardness, introduced an exact dynamic pseudo-polynomial programming algorithm, and solved several special cases. Sterna [7] provides a number of applications of the late work criterion, and claims that in general, it appears to be relevant to all settings where the penalty depends on the number of tardy jobs performed in the system, regardless of how late these are. Some applications arise in control systems [2] and [5], computerized control systems [4], batch scheduling problems [6], various issues in agriculture [1], and systems containing perishable items [5].