检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《信息与控制》1998年第5期394-400,共7页Information and Control
摘 要:研究了单机作业下任务的加工时间为模糊区间数的提前/拖期调度问题.目标函数考虑了任务的提前/拖期惩罚、交货期惩罚、完工时间惩罚以及加工时间的模糊区间取值惩罚.目标是找到最优的交货期、最优的排序以及最优的加工时间,使目标函数的值最小.运用了公共交货期(CON)的方法确定了任务的最优公共交货期,运用模拟退火技术确定了任务的最优加工顺序,最后的计算机仿真结果分析了模拟退火算法解该问题的性能.This paper considers earliness/tardiness scheduling problem in which the jobs have fuzzy processing times on a single machine. The objective is to determine the optimal due-date, the optimal sequencing and the optimal processing times to minimize a total objective function based on earliness/tardiness, due-dates, completion times and the deviation of actual processing times from the maximum values of fuzzy interval numbers of processing times. The common due date assigement mathod is used to find the optimal common due date. Simulated annealing technique is presented for finding the optimal sequencing. In the end, we analysis performance measures of simulated annealing method in solving our problem using the computer simulated results.
分 类 号:O224[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28