流水车间作业的优化模型

Optimization Pattern of the Flow Shop Sequencing Schedules

本文将文献中的方法和结论推广到一般排序的流水车间作业.首先定义了流水车间作业的规范作业矩阵、机器空闲时间矩阵和零件等待时间矩阵,证明了两个关系定理,然后建立了流水车间作业的优化模型,并给出了求解最优作业矩阵的方法,最后给出一个算例.

This paper extends the methods and conclusions of the paper [1] to the ordinary flow shop sequencing schedules. As a beginning, normal schedule matrix, idle time matrix of machines and waiting time matrix of jobs are defined. Furthermore, two relation theorems are testified. Then, it sets up optimization pattern of the ordinary flow shop sequencing sehedules, and provides the way of counting the normal schedule matrix, and also presents an example.