Some Extensions of the Discrete Lotsizing and Scheduling Problem
研究离散批量与调度问题（DLSP），提出问题分类并分析单机和并行机变体的计算复杂性，讨论高效求解算法，对生产计划制定者有用。
In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) is considered. DLSP relates to capacitated lotsizing as well as to job scheduling problems and is concerned with determining a feasible production schedule with minimal total costs in a single-stage manufacturing process. This involves the sequencing and sizing of production lots for a number of different items over a discrete and finite planning horizon. Feasibility of production schedules is subject to production quantities being within bounds set by capacity. A problem classification for DLSP is introduced and results on computational complexity are derived for a number of single and parallel machine problems. Furthermore, efficient algorithms are discussed for solving special single and parallel machine variants of DLSP.