检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王丹[1]
机构地区:[1]沈阳航空工业学院理学院,辽宁沈阳110136
出 处:《沈阳航空工业学院学报》2009年第4期82-84,共3页Journal of Shenyang Institute of Aeronautical Engineering
摘 要:讨论工件具有老化效应的单机多目标排序问题,目标函数分别为极小化提前时间、延误时间、共同松弛时间的加权和,极小化等待时间和与等待时间偏差和的线性组合,极小化提前时间、延误时间、最早交货期及窗口长度的加权和。用数学规划的方法证明了这三类多目标单机排序问题在工件引入老化效应后都可以转化为指派问题,从而都多项式时间可解。In this paper, we consider multi - criteria single machine scheduling problems with an aging effect. The objectives are to minimize a linear function of the common slack time, the earliness and tardiness for all jobs, a cost function based on a linear function of total waiting time and total variation of waiting time, and a cost function based on earliness, tardiness, window size, and window location. We show that these three types of single machine scheduling problems with an aging effect can be modeled as an assignment problem by mathematical programming method, thus these three types problems can be solved in polynomial time.
分 类 号:O223[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28