Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
提出一种新模型，将多机器环境下的序列依赖调整成本问题分解为可处理的子序列，并采用列生成与分支定界方法求解，在五个工业实例中验证了有效性。
Industrial lotsizing and scheduling pose very difficult analytical problems. We propose an unconventional model that deals with sequence-dependent setup costs in a multiple-machine environment. The sequence-splitting model splits an entire schedule into subsequences, leading to tractable subproblems. An optimization approach based on a column generation/branch and bound methodology is developed, and heuristically adapted to test problems including five real-world problem instances gathered from industry.