多种产品生产系统的生产计划问题

PERIODIC SCHEDULING PROBLEM FOR A PRODUCTION SYSTEM

研究一个为满足确定性需求而进行产品生产的系统。系统中有一台用于生产的机器,生产n种不同的产品。每一种产品都有确定的日需求。我们将能够满足所有产品需求的生产计划称之为可行计划。主要想通过数学模型,来建立一套判定可行计划存在性的理论。在确保存在可行计划的前提下,设计了一种找寻出具体可行计划的计算方法。并且,进一步可以通过0-1规划来优化系统的效率,称之为最小化产能占用率。

The model of periodic scheduling problem in a production system consists of one machine （service center）, n productions and different periodic demands with no backlogging. The existence of feasible schedules are proven under certain conditions. The related methods and algorithms are designed to give several sufficient conditions. Also a searching algorithm is provided as a necessary and sufficient condition. Finally the optimization of periodic schedule to a 0-1 linear program is obtained.