检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东北大学信息科学与工程学院系统工程系,沈阳110006
出 处:《控制理论与应用》2000年第1期9-13,18,共6页Control Theory & Applications
摘 要:交货期窗口下的交货期确定和排序问题是调度领域研究的一个方面 .本文对交货期窗口下的单机作业问题进行了研究 ,目标函数不仅考虑提前 /拖期惩罚 ,还考虑附加惩罚 .假设如果任务在交货期窗口内完工 ,则不受提前/拖期惩罚 ;如果在交货期窗口外完工 ,将导致提前 /拖期惩罚 .本文确定了最优公共交货期 ,给出了相应的最优排序 ,并提出了一个多项式时间算法确定了使目标函数为最小的最优调度 ,最后的数值例子说明了算法的有效性 .Due date assignment and sequencing problem is one of the scheduling fields about due window. This paper is concerned with single machine problem about due window, the objective function concludes earliness/tardiness penalties and additional penalties. It is assumed that earliness/tardiness penalties will not occur if a job is completed within the due window; Otherwise, earliness/tardiness penalties will occur if a job is completed outside the due window. The optimal common due date is assigned, and the optimal sequencing are also given. A polynomial time algorithm is presented for determining the optimal scheduling. Finally, a numerical example is provided to illustrate the effectiveness of our results.
分 类 号:TP15[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.106