一类带缓冲区的连续生产过程的最速生产调度

Makespan Scheduling for A Class of Continuous Productions with Buffers

研究了一类有分段式生产任务并带缓冲区约束的连续生产最早完工 （Ｍａｋｅｓｐａｎ）指标调度问题。对积分形式约束和专注生产的约束进行有 效转化，将原调度问题转换为线性规划问题。仿真算例表明了文中方法 是可行的。

In this paper,the scheduling for a class of productions with piecewise pro- duction tasks and makespan requirements is studied. Through transforming the constraints in integration form and on the single product manufactur- ing,the problem can be solved with linear programming. Simulation for an actual example indicates that the algorithm mentioned is available.