单件车间生产作业计划的模糊化启发式算法  

FUZZY HEURISTIC ALGORITHM BASED ON JOB-SHOP PRODUCTION PLAN SCHEDULING PROBLEM

作　　者：刘鸿雁[1] 李琦[1] 王睿智[1] 

机构地区：[1]鞍山科技大学,鞍山114044

出　　处：《计算机应用与软件》2004年第12期87-89,共3页Computer Applications and Software

摘　　要：本文给出了编制单件车间生产作业计划的一种实用算法。针对工件之间存在的加工顺序关系 ,引入“组装树”的概念。在传统调度法则基础上 ,对影响排序的两个重要参数———工序的“准备就绪时间”和“余下加工时间”在量化上进行模糊处理 ,引入模糊算子α、β ,构造了模糊化启发式算法 ,使MWKR(MostWorkRemaining)和SPT(ShortestProcessingTime)调度法则在工序的准备就绪时间或余下加工时间基本相近时有效地发挥作用 ,兼顾了组装件中长周期工件优先安排。此算法运行速度和运行结果均明显优于经典的启发式算法。This paper proposes a practical algorithm for job scheduling of work piece processing.According to the processing sequence of work pieces,we introduced the concept of “tree of assembly”.Based on classical scheduling algorithms,we applied fuzzy processing to the quantification of two of the most important parameters affecting the sequencing of work piece processing ——“arriving time for getting ready”and “remaining processing time”.By introducing operators α and β,we constructed a fuzzy heuristic algorithm which makes MWKR(Most Work Remaining)and SPT(Shortest Processing Time)scheduling rules more efficient when time for getting ready and remaining processing time are approximately equal,and also takes account of long-cycle work piece priority in assembly.This algorithm has been used in practice,and its speed and performance are better than those of classical heuristics.

关 键 词：模糊化启发式算法 PGPS算法 单件车间生产作业计划 调度问题 

分 类 号：O224[理学—运筹学与控制论] TP301.6[理学—数学]