期刊文献+

贪婪策略在占线订单加工问题中的竞争分析 被引量:2

Competitive Analysis of Greedy Strategy in Online Order Scheduling Problem
下载PDF
导出
摘要 根据实际生产中订单收益随加工长度变化的一般规律,建立了占线订单加工模型,构建一种贪婪策略并分析它在本模型中的竞争性能。具体证明它在中断订单有、无惩罚两种情形下的竞争比,并讨论了模型中收益函数的参数对竞争比结果的影响。 The set up an online revenue in pract sit en greedy strategy performs well in various kinds of order scheduling model, which reflects the general ice. Then a gree uations with or without the ue function in the greedy's practical applications. variation rule between In this paper we order length and dy strategy is put forward and proved to be competitive in two different ortion penalty. Finally, discuss the influence of the parameters of the revcompetitive ratios.
出处 《系统管理学报》 北大核心 2007年第4期417-421,共5页 Journal of Systems & Management
基金 国家自然科学基金资助项目(70525004 70121001 70471035)
关键词 贪婪策略 占线问题 订单排序 竞争比 greedy strategy online problem order scheduling competitive ratio
  • 相关文献

参考文献8

  • 1朱志军,徐寅峰.加拿大旅行者问题[J].系统工程理论方法应用,2003,12(2):177-181. 被引量:5
  • 2[2]Ausiello G,Giannakos A,Paschos V T.Greedy algorithms for on-line set-covering and related problems[C]//In Proc Twelfth Computing:The Australasian Theory Symposium (CATS2006).Hobart,Australia.CRPIT,51.ACS.2006:145-151.
  • 3杨杰.改进的最优顶点覆盖贪心边近似算法[J].计算机应用,2006,26(1):149-151. 被引量:6
  • 4肖华勇,田铮,师义民.资源公平分配的一种贪婪算法[J].运筹与管理,2000,9(2):37-42. 被引量:10
  • 5[5]Thomas H C,Charles E L,Ronald L R,et al.Introduction to algorithms[M].The MIT Press,2002:370-399.
  • 6[6]Woeginger G J.On-line scheduling of jobs with fixed start and end times[J].Theoretical Computer Science,1994,130:5-16.
  • 7[7]Goldwasser M H.Patience is a virtue:The effect of slack on competitiveness for admission control[C]//Proc of the 10th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA99).1999:396-405.
  • 8[8]Borodin A,El-yaniv R.Online computation and competitive analysis[M].Cambridge University Press,1998:12-13.

二级参考文献16

  • 1徐寅峰,王刊良.局内出租车调度与竞争算法[J].西安交通大学学报,1997,31(S1):58-63. 被引量:26
  • 2岳林.关于Q值法的一种新定义[J].系统工程,1995,13(4):70-72. 被引量:34
  • 3严余松.席位公平分配的0-1规划模型[J].系统工程,1996,14(5):51-53. 被引量:27
  • 4GAREY MR, JOHNSON DS. Strong NP-completeness results: motivation, examples, and implications[J]. Journal of ACM, 1978, 25(3): 499 -508.
  • 5KARP R. Reducibility among combinatorial problems[A]. MILLER RE, THATCHER JW, eds. Complexity of Computer Computations[C]. Plenum Press, NY, 1972.85 - 103.
  • 6CORMEN TH, LEISERSON CE, RIVEST RL, et al. Introduction to Algorithms[M]. Second Edition. The MIT Press, 2001.1024-1027, 1040 - 1043.
  • 7BAR-YEHUDA R, EVEN S. A local-ratio theorem for approximating the weighted vertex cover problem[J]. Annals of Discrete Mathematics, 1985, 25:27-46.
  • 8MONIEN B, SPECKENMEYER E. Ramsey numbers and an approximation algorithm for the vertex cover problem[J]. Acta Informatica, 1985,22(1) : 115 - 123.
  • 9HALPERIN E. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs[A]. Proc. 11th Ann[C].ACM-SIAM Symposium on Discrete Algorithms, 2000. 329-337.
  • 10HALPERIN E . Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs[J]. SIAM J. on Computing. 2002.31 (5): 1608 - 1623.

共引文献18

同被引文献13

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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