Research Initiation: Efficient Algorithms for Some Product-ion Planning Problems

这项研究解决了两个问题。首先，当需求和成本只能预测到未来相对较短的一段时间时，如何为无限期的生产计划？第二，生产计划人员如何在同一台机器上安排不同产品的工作以最小化成本（经济批次调度问题）？将开发有效的算法来解决这些问题的变化。

This research addresses two problems. First, how does one plan production for an indefinite period when demands and costs can be forecast only for a relatively short period in the future? Second, how can a production planner schedule work on several different items on the same machine to minimize cost (the Economic Lot Scheduling Problem)? Efficient algorithms will be developed for the solution of variations of these problems.