摘要
针对可预见的干扰管理问题,考虑单机环境下,加权折扣最短加工时间优先(WDSPT)序为原目标的最优加工次序,研究了如何对初始加工时间表进行修改。在干扰事件影响下,初始加工时间表将不再是最优,甚至不再可行。和大多数重排序研究不同,构建了同时考虑原目标和由干扰事件造成的扰动目标的重排序模型,并基于理想点法提出一种动态规划算法来求解所建模型中的双目标排序问题。最后通过一个数值算例来说明该重调度模型对于求解带折扣因子的单机干扰管理问题是有效的。
This research investigates the issue of revising a machine schedule,when a predictable disruption occurs after a subset of the jobs has been processed on a single machine.The paper concentrates on the case where the Weighted Discounted Shortest Processing Time（WDSPT）rule is optimal for the original scheduling problem.In such case,the original schedule is no longer optimal or feasible.The approach developed here differs from most rescheduling researches in that both the original objective and the deviation cost caused by disruption are considered.Based on ideal point method,a dynamic programming algorithm is adopted to deal with the up-rising bi-criteria scheduling problem.Finally a numerical experiment is given to illustrate the model and its effectiveness for the disruption management problem.
出处
《运筹与管理》
CSCD
北大核心
2011年第5期39-45,共7页
Operations Research and Management Science
基金
国家自然科学基金重大资助项目(70890080
70890083)
辽宁省博士科研启动基金项目(20081093)
关键词
运筹学
重排序
动态规划
干扰管理
WDSPT规则
operation research
rescheduling
dynamic programming
disruption management
WDSPT rule
