改进的禁忌搜索算法求解多机并行模糊调度问题  

A New Tabu Search Algorithm to Solve Concurrent Fuzzy Multimachine Scheduling Problem

作　　者：梁旭[1] 赵戈[1] 王民生[1] 

机构地区：[1]大连交通大学软件学院,辽宁大连116028

出　　处：《大连交通大学学报》2009年第4期51-54,59,共5页Journal of Dalian Jiaotong University

基　　金：大连市计划资助项目(2007A10GX10);辽宁省自然科学基金资助项目(20072161);辽宁省教育厅高等学校科学研究计划资助项目(2008092)

摘　　要：提出一种改进的禁忌搜索算法求解多机并行模糊调度问题,该算法在邻域中引入记忆结构,可以减少重复搜索,并对候选解集使用映射排序法进行剪枝,减少了搜索空间,从而极大的提高了算法效率.同时为了减少计算误差,该算法计算时不需要将模糊时间转换为精确时间求解,可以同时处理作业加工时间是三角模糊数或梯形模糊数的情况,从而更具有通用性.仿真结果证明该算法有效、可行.A new tabu search algorithm to solving concurrent fuzzy muhimachine scheduling problem is proposed. The memory structure is applied to neighbor in order to reduce repeated search. At the same time,mapping-order algorithm is used to deduce the number of candidate solutions to improve searching efficiency. In order to reduce error, this algorithm does not need to turn fuzzy time into accurate time during calculation.The algorithm can deal with the situation in which job processing time is triangle fuzzy number and trapezoid fuzzy number, so that the common ability is strengthened. The experiment results indicate that the algorithm is effective and applicable.

关 键 词：车间调度 模糊时间 禁忌搜索 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]