Comments on the Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem

One of the necessary and sufficient conditions derived by F. F. Boctor (1982) for feasibility of a repetitive two-product schedule is that the cycle times (T 1 and T 2 ) must be integer multiples of some time interval T (Propositions 2, 3 and 4). This result also holds for N-product schedules. However, the proof for Propositions 3 and 4 in [1] is not exactly valid and therefore a correction has to be made.

• 저널Management Science · 39(3) · 387–388
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.39.3.387
• 저자Shaoxiang Chen