一个多功能流水冲突优化调度算法  

An Optimal Scheduling Algorithm for Multi-function Flow Shops

作　　者：王素[1] 张义清[1] 

机构地区：[1]南通大学理学院,江苏南通226007

出　　处：《南通大学学报（自然科学版）》2007年第2期7-10,共4页Journal of Nantong University(Natural Science Edition)　

基　　金：南通大学自然科学基金项目(05Z005)

摘　　要：在对多功能流水冲突问题进行分析的基础上,给出了用时段间隔矩阵表示流水线冲突状态的方法,分别计算出每种调度法的平均间隔时段数,找出其中的最小者,实现了流水线各后继任务流入流水线所用间隔的最佳调度.此调度策略,使流水线的吞吐率达到最高,且方法简便明确,易于计算机实现.文章同时给出了实现多功能流水线冲突的优化调度算法.Introducing the conflict of multi-function flow-shop, this paper presents a method to express the conflict state of flow-shop with a time-interval matrix. The average intervals of each scheduling method were calculated and the shortest interval was found, from which the optimal interval scheduling for all subsequent tasks lined in a flow shop was obtained. The scheduling algorithm not only helps achieve the maximum handling capacity of the flow shop, but is clear and easy for computer to realize. The paper also gives an optimal scheduling algorithm to deal with the conflicts of muhifunction flow shops.

关 键 词：流水线 调度 冲突矩阵 算法 

分 类 号：O29[理学—应用数学]