期刊文献+

基于占线排序D-收益函数的战时维修改进策略 被引量:1

An Improved Strategy for Wartime Maintenance Based On-line Scheduling Problem With D-benevolent Function
下载PDF
导出
摘要 由于战时作战强度、战场环境变化不确定性,导致战损或故障装备的产生无法提前获知,从而战时装备维修机构受领维修任务进行装备维修作业成为一个占线问题。采用占线单服务排序理论对该问题进行建模,定义了战时装备维修收益函数,设计了一种改进的基于单位平均收益的单服务维修策略,推断了其有效竞争在概率意义上为2/η(η>>1,η是与不同维修任务类型发生概率相关的统计量),为战时装备维修策略选择提供了新思路和可行做法。 For uncertain wartime environment , it is difficult to get the information about damaged or broken-down equipment in advance , that makes maintenance task be a online question .We model the question with online single scheduling theory , design an effectiveness function and present an improved single service strategy based on unit average benevolent .We further put forward and prove that the competitive ratio of the strategy is 2/η(η>>1,ηis a probably statistic variable with maintenance task ).We present a new plan method and feasible way for wartime maintenance strategy .
出处 《运筹与管理》 CSSCI CSCD 北大核心 2014年第6期163-166,204,共5页 Operations Research and Management Science
基金 军队装备预研课题(513270202)
关键词 占线策略 收益函数 竞争比 战时维修 online strategy benevolent function competitive ratio wartime maintenance
  • 相关文献

参考文献11

二级参考文献43

  • 1刘培海,鲁习文.P|rj,on-line|∑C_j的一类在线算法与竞争比分析[J].运筹与管理,2007,16(3):56-60. 被引量:2
  • 2徐寅峰,王刊良.局内出租车调度与竞争算法[J].西安交通大学学报,1997,31(S1):58-63. 被引量:26
  • 3马卫民,王刊良.局内封闭式车辆调度问题及其竞争策略[J].系统工程理论与实践,2004,24(9):72-78. 被引量:11
  • 4Hoogeveen H, Poots C N, Woeginger G J. On-line scheduling on a single machine: maximizing the number of early jobs[ J]. Operations Research Letters, 2000, 27: 193-197.
  • 5Woeginger G J. On-line scheduling of jobs with fixed start and end times[ J]. Theoretical Computer Science, 1994, 130(1 ) : 5-16.
  • 6Seiden S S. Randomized online interval scheduling[J]. Operations Research Letters, 1998, 22: 171-177.
  • 7Miyazawa H, Erlebaeh T. An improved randomized on-line algorithm for a weighted interval selection problem[ J]. Journal of Scheduling, 2004, 7 : 293-311.
  • 8Fung S P Y, Poon C K, Zheng F F. Online interval scheduling: randomized and muhiprocessor cases[ J]. Journal of Combinatorial Optimization, 2008, 16 : 248-262.
  • 9Epstein L, Levin A. Improved randomized results for that interval selection problem[ A]. In 16th Annual European Symposium on Algorithms[ C]. Karlsruhe, Germany, 2008, 381-392.
  • 10Sleator D, Tarjan R. Amortized efficiency of list update and paging rules [ J]. Communications of tile ACM, 1985, 28 (2) : 202-208.

共引文献19

同被引文献11

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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