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.