The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem
Management Science · 1982 · Volume 28 · Issue 7
Abstract
In this paper, we deal with the two-product, single-machine, static demand, infinite horizon lot scheduling problem. After a quick review of the literature, the necessary and sufficient conditions for feasibility are derived without imposing any preliminary requirements. Then, an optimal solution algorithm is presented. Finally, we show that a necessary condition for the feasibility of N -product schedules is that each cycle time be an integer multiple of some basic cycle time.
Keywords
inventory/production: deterministic models, inventory/production: planning horizons, production/scheduling
Enable JavaScript for citation tools and additional paper interactions.