期刊文献+

有阈值约束的占线订单加工策略及竞争分析 被引量:3

Online Strategy and Competitive Analysis in Order Scheduling Problem with Threshold Bound
下载PDF
导出
摘要 结合生产订单管理的实际情形,将服务质量(QOS)的概念引入订单排序加工问题,并运用占线理论与竞争分析方法对此问题进行建模与剖析。在有QOS要求的模型中,订单收益与订单完成百分比成正比;在实际情况下,只有当订单完成百分比超过一定量时才是有效加工并获得相应收益。因此,构建了具有完成度阈值限制的可中断占线订单加工模型;其次,运用贪婪设计思想给出一个确定性占线策略并证明其具有竞争比(1+3α)/(1+α),其中,α∈[2/3,1)是订单完成度阈值参数。 Combining actual situations in order processing management,we introduce the concept of quality of service(QOS) to order scheduling,and adopt online theory and the method of competitive analysis in problem modeling and analysis.In QOS online model,the revenue of an order to be obtained by an online strategy increases in the length of time to process the order,and we further consider the case where no revenue can be obtained from an preempted order unless the percentage to be processed is large enough,i.e.,no less than the threshold bound α∈(0,1).We first establish an online order processing model with threshold bound of completion degree of order.A greedy strategy is then put forward and proved to be((1+3α)/(1+α))-competitive,where α∈[2/3,1).
出处 《系统管理学报》 CSSCI 北大核心 2010年第5期571-576,共6页 Journal of Systems & Management
基金 国家杰出青年基金资助项目(70525004) 国家自然科学基金资助项目(70702030 70602031) 教育部博士点新教师基金资助项目(20070698053)
关键词 订单排序 完成度阈值 竞争比 占线策略 order scheduling completion degree threshold competitive ratio online strategy
  • 相关文献

参考文献6

  • 1Chang E C, Yap C. Competitive on-line scheduling with level of service[J]. Journal of Scheduling, 2003, 6(3) ..251-267.
  • 2Chin F Y L, Fung S P Y. Improved competitive algorithms for online scheduling with partial job values[J]. Theoretical Computer Science, 2004, 325:467-478.
  • 3Borodin A, E1-Yaniv R. Online computation and competitive analysis[M]. Cambridge: Cambridge University Press, 1998.
  • 4郑斐峰,徐寅峰.贪婪策略在占线订单加工问题中的竞争分析[J].系统管理学报,2007,16(4):417-421. 被引量:2
  • 5Bansal N. Shortest elapsed time first scheduling[C]// Kao M Y. In Encyclopedia of Algorithms. Springer, 2008 : 834-836.
  • 6Goldman S A, Parwatikar J, Suri S. On-line scheduling with hard deadlines [J]. Algorithms and Data Structures, 1997, 1272: 258-271.

二级参考文献8

  • 1杨杰.改进的最优顶点覆盖贪心边近似算法[J].计算机应用,2006,26(1):149-151. 被引量:6
  • 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[5]Thomas H C,Charles E L,Ronald L R,et al.Introduction to algorithms[M].The MIT Press,2002:370-399.
  • 4[6]Woeginger G J.On-line scheduling of jobs with fixed start and end times[J].Theoretical Computer Science,1994,130:5-16.
  • 5[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.
  • 6[8]Borodin A,El-yaniv R.Online computation and competitive analysis[M].Cambridge University Press,1998:12-13.
  • 7肖华勇,田铮,师义民.资源公平分配的一种贪婪算法[J].运筹与管理,2000,9(2):37-42. 被引量:10
  • 8朱志军,徐寅峰.加拿大旅行者问题[J].系统工程理论方法应用,2003,12(2):177-181. 被引量:5

共引文献1

同被引文献22

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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