The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem

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.

• 저널Management Science · 28(7) · 798–807
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.28.7.798
• 저자Fayez F. Boctor