固定工件排序问题的网络流模型研究

Network Flow Model for Fixed Job Scheduling Problem

针对一般形式的固定工件排序问题(即可用机器数是有限的,存在机器与工件间匹配约束,以机器分配成本最小为优化目标),作者通过建立描述工件间时序关系的工件时序网络,将固定工件的排序问题转化为沿工件时序网络的网络流问题,并建立了0-1整数规划数学模型。

This paper investigates the generalized fixed job scheduling problem(FJSP),in which the available processors are limited,the job-processor matching has to be considered and processor-assigning cost is minimized.By constructing a job-schedule network that can present job-time relationship,the FJSP is transformed to a network flow problem,and a 0-1 integer programming mathematical model is developed.