Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources
提出一种启发式方法，用于解决具有一般装配结构、多个约束资源以及非零设置成本和设置时间的多产品批量确定问题，并通过与最优解和OSL求解器对比验证其性能。
We introduce a heuristic method for finding good, feasible solutions for multiproduct lot sizing problems with general assembly structures, multiple constrained resources, and nonzero setup costs and setup times. We evaluate the performance of this heuristic by comparing its solutions to optimal solutions of small randomly generated problems and to time-truncated Optimization Subroutine Library (OSL) solutions of medium-sized randomly generated problems. In the first case, the heuristic locates solutions averaging 4 percent worse than optimal in less than 1 percent of time required by OSL. The heuristic solutions to medium-sized problems are approximately 26 percent better than solutions OSL finds after 10,000 CPU seconds, and the heuristic finds these solutions in approximately 10 percent of OSL time.