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.