期刊文献+

动态单机调度的一种滚动时域策略及全局性能分析 被引量:4

A Rolling Horizon Strategy for Dynamic Single-machine Scheduling Problem and Analysis of the Global Performances
原文传递
导出
摘要  针对全局信息不完全的一种单机的动态调度模型,设计了局部调度子问题带终端惩罚函数的滚动调度策略,并对这种滚动调度策略下的全局性能进行了分析.通过对未知工件按FIFO规则进行虚拟调度,对滚动调度进程中的全局性能进行评估,证明了在所给滚动调度策略下,随着工件信息的逐步获取,全局调度中的虚拟调度逐步变为已知调度,并经过滚动局部调度而部分实现,决策时刻向前推进,对全局性能指标的估计越来越接近将实现的实际值,逐步实现的全局调度性能相对历次的估计值不断改善.终端罚函数滚动调度策略可以保证滚动调度进程中全局性能的稳定性,当工件到达较快时,文中的滚动调度策略更有优势. A rolling horizon strategy for the single-machine scheduling problems with incomplete global information was presented. A terminal penalty function was appended to the objective function of each sub-problem in the rolling scheduling strategy. The global performances were analyzed. The global procedural performance was estimated based on a virtual schedule for unknown jobs using FIFO rule. When information of partial jobs is obtained, the partial virtual schedule is specified, locally scheduling is made based on known jobs, and a partition of the local schedule is implemented. It is concluded that while the decision time is being put forward, the estimation of the global performance is getting close to the ultimately implemented actual cost and getting better and better step by step. It is assured that global performance is consistently not worse than that of FIFO anyway. This kind of rolling scheduling strategy is more advantageous when jobs release rapidly.
作者 王冰
出处 《系统工程理论与实践》 EI CSCD 北大核心 2004年第9期65-71,84,共8页 Systems Engineering-Theory & Practice
基金 国家自然科学基金(60274013) 山东大学青年科学基金(11010053187075) 山东大学威海分校科研项目(Z203040)
关键词 滚动时域调度 不完全信息 局部调度 滚动窗口 终端罚函数 rolling horizon scheduling incomplete information local scheduling rolling window terminal penalty function
  • 相关文献

参考文献8

  • 1Weizhen Mao, Rex K Kincaid. A look-ahead heuristic for scheduling jobs with release dates on a single machine[J]. Computers Ops Res, 1994,21(10):1041-1050. 被引量:1
  • 2Ovacik I M, et al. Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times[J]. International Journal of Production Research, 1994, 32(6):1243-1263. 被引量:1
  • 3Singer Marcos. Decomposition methods for large job shops[J]. Computers & Operations Research, 2001, 28:193-207. 被引量:1
  • 4Fang Jian, Xi Yugeng. Rolling horizon job shop rescheduling strategy in the dynamic environment[J]. International Journal of Advanced Manufacturing Technology, 1997, 13:227-232. 被引量:1
  • 5Suresh Chand, Rodney Traub, Reha Uzsoy. Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates[J]. Annals of Operations Research, 1997,70: 115-125. 被引量:1
  • 6Wang Bing, Xi Yugeng, Gu Hanyu. Rolling horizon heuristic for single-machine scheduling problem[A]. Proceedings of 2004 World Conference of Inte lligent Control and Automation[C]. Hangzhou, China, 2004:2872-2876. 被引量:1
  • 7Nicolao G D, Magni L, Scattolini R. On the robustness of receding-horizon control with terminal constraints[J]. IEEE Trans Automat Contr, 1996, 41(3): 451-453. 被引量:1
  • 8席裕庚 耿晓军.非线性系统滚动时域控制的性质研究[J].控制理论与应用,1999,16:118-123. 被引量:1

同被引文献41

  • 1闵啸,耕田.带缓冲区的平行机半在线排序问题的近似算法[J].嘉兴学院学报,2005,17(3):31-35. 被引量:2
  • 2李建国,陈松乔,鲁志辉.实时异构系统的动态分批优化调度算法[J].计算机学报,2006,29(6):976-984. 被引量:13
  • 3周长峰,谭跃进,廖良才.实时条件下多车辆路径与调度[J].系统工程,2006,24(5):35-39. 被引量:2
  • 4Goldberg D E,Smith R E. Nonstationary function optimization using genetic algorithms with dominance and diploidy[C]//Proc of the 2nd Int Conf on Genetic Algorithms, 1987:59- 68. 被引量:1
  • 5Branke J, Kaubler T. A multi-population approach to dynamic optimization problems[ C]//In Adaptive Computing in Design and Manufacturing,2000: 1497 - 1513. 被引量:1
  • 6Collard P, Escazut C. An evolutionary approach for time dependant optimization[J]. International Journal on Artificial Intelligence Tools, 1997, 6(4) :665 - 695. 被引量:1
  • 7Yang S. Non-stationary problem optimization using the primal-dual genetic algorithm [C]//Proc of the IEEE Congress on Evolutionary Computation, Chicago, IEEE Service Center, 2003: 2246- 2253. 被引量:1
  • 8Wang H, Wang D. An improved primal-dual genetic algorithm for optimization in dynamic environments[ C]//13th International Conference on Neural Information Processing, Part Ⅲ, 2006:836 - 844. 被引量:1
  • 9Vinicius A. Tabu search for total tardiness minimization in flowshop scheduling problems[J]. Computers & Operations Research, 1999,26(4) :219 - 235. 被引量:1
  • 10Swaminathan R. Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times[J]. Computers & Operations Besearch,2007,34(4):3055- 3068. 被引量:1

引证文献4

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部