When Is The Economic Lot Scheduling Problem Easy?

Abstract

Abstract The Economic Lot Scheduling Problem, common in industry and the literature as well, is NP-hard and remains unsolved in general. We show 'that the very simple Rotation Cycle scheduling rule produces optimal or nearly optimal schedules in very many realistic situations and we give upper bounds for the maximum percentage deviation of the Rotation Cycle's schedule fro m optimality. An implication for Group Technology is discussed.