Discrete Lotsizing and Scheduling by Batch Sequencing
把单机离散批量与调度问题转化为批次排序问题，用分支定界算法求解，并对比已有方法，发现当产品种类不多时效率更高。
The discrete lotsizing and scheduling problem for one machine with sequence-dependent setup times and setup costs is solved as a single machine scheduling problem, which we term the batch sequencing problem. The relationship between the lotsizing problem and the batch sequencing problem is analyzed. The batch sequencing problem is solved with a branch & bound algorithm which is accelerated by bounding and dominance rules. The algorithm is compared with recently published procedures for solving variants of the DLSP and is found to be more efficient if the number of items is not large.