期刊文献+

动态邻接资源调度系统稳定性的仿真试验研究

Simulation Experimental Research on Stability of Dynamic Adjacent Resource Scheduling System
下载PDF
导出
摘要 针对邻接资源调度为一类特殊的资源约束调度问题,结合排队系统理论及在线装箱过程,建立了动态邻接资源调度模型及系统稳定性判断算法,并探讨了任务尺寸随机分布状态对系统稳定性的影响。仿真试验结果表明,任务尺寸均匀分布的动态邻接资源调度系统具有与多服务台排队系统一致的稳定性特征,且其尺寸分布区间的长度对系统稳定性的影响较明显。 Adjacent resource scheduling(ARS) is a special resource constrained scheduling problems.Combining queuing system theory with online bin-packing,the dynamic ARS model and system stability evaluation algorithm are established.And it explores the influence of the random distribution range state of the job size on the system stability.The simulation experiment shows the coherence between the stability properties of multi-server queuing system and the dynamic ARS system with uniform distribution of the packing items size.It is also shown that the stability of dynamic ARS system will be affected by the interval length of the distribution range of the job size.
出处 《水电能源科学》 北大核心 2011年第4期161-164,共4页 Water Resources and Power
基金 国家自然科学基金资助项目(60904073)
关键词 资源约束调度 邻接资源调度 排队系统 动态装箱 系统仿真 resource constrained scheduling adjacent resource scheduling queuing system dynamic packing system simulation
  • 相关文献

参考文献10

  • 1Jaeek Blazewicz, Klaus H Ecker, Erwin Pesch,et al Handbook on Scheduling: From Theory to Appliea tions[M]. New York.. Springer-Verlag Berlin Heidel berg, 2007.
  • 2杨鼎强,王晨.局内装箱算法综述[J].计算机与现代化,2005(5):7-11. 被引量:2
  • 3William Leinberger, George Karypis, Vipin Kumar. Multi-capacity Bin Packing Algorithms with Appli- cations to Job Scheduling under Multiple Con- straints[R]. Minnesota.. Department of Computer Sci- ence and Engineering, University of Minnesota, 1999.
  • 4Devavrat Shah, John N Tsitsiklis. Bin Packing with Queues [EB/OL]. http..//www, mit. edu/~ de- vavrat/binpack, pdf, 2006-12-04.
  • 5Duin C W, Van Sluis E. ()n the Complexity of Ad- jacent Resource Scheduling[J]. Journal of Schedu- ling, 2006, 9(1): 49-62.
  • 6Jacob Jan Paulus, Johann Hurink. Adjacent-resource Scheduling: Why Spatial Resources are so Hard to Incorporate[J]. Electronic Notes in Discrete Mathe- matics, 2006, 25: 113-116.
  • 7Hurink J L, Paulus J J. Online Algorithms for Par- allel Job Scheduling and Strip Packing[A]. Pro- ceeding of the 5th International Workshop on Ap- proximation and Online Algorithms [C]. Eilat, 2008..67 74.
  • 8Ranjan Vargheset, Duck Young YoorL Dynamic Spatial Block Arrangement Scheduling in Shipbuilding Industry Using Genetic Algorithm[A]. Proceedings of the 3rd IEEE International Conference on Industrial Informatics [C]. Perth, 2005 : 444-449.
  • 9Piyush Raj, Rajiv K Srivastava. Analytical and Heuris- tic Approaches for Solving the Spatial Scheduling Prob- lem[A]. Proceedings of the 2007 IEEE IEEM[C]. Singapore, 2007:1 093-1 097.
  • 10Lueker G S. Bin Packing with Items Uniformly Dis- tributed Over Intervals [a, b] [A]. 24th Annual Symposiumon Foundations of Computer Science [C]. Tucson, 1983:289-297.

二级参考文献20

  • 1Steven S Seiden,Rob Van Stee, Leah Epstein. New bounds for variable-sized online bin packing[J]. SIAM Journal on Computing,2002,32(2):455-469.
  • 2P Manyem. Bin packing and covering with longest items at the bottom[J]. ANZIAM Journal,2002,43(E): 186-232.
  • 3J Csirik, D S Johnson. Bounded space on-line bin packing beet is better than first[A]. Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms[C]. 1991. 309-319.
  • 4Johnson D S. Fast algorithms for bin packing[J].Journal of Computer and System Sciences,1974,8: 272-314.
  • 5D S Johnson,A Demers,J D llman,M R Garey,R L Graham.Worst-case performance bounds for simple one-dimensional packing algorithms[J]. SIAM Journal on Computing,1974,3(4): 299-325.
  • 6Yao A C C.New algorithms for bin packing[J]. Journal of the ACM, 1980, 27:207-227.
  • 7Brown D J.A Lower Bound for On-line One-dimensional Bin Packing Algorithms[R]. Tech. Rep. R-864, Coordinated Sci. Lab., University of Illinois at Urbana-Champaign, 1979.
  • 8Liang F M.A lower bound for online bin packing[J].Information Processing Letters,1980,10:76-79.
  • 9Van Vliet A.An improved lower bound for online bin packing algorithms[J].Information Processing Letters,1992,43(5):277-284.
  • 10Lee C,Lee D.A simple on-line bin-packing algorithm[J]. Journal of the ACM,1985,32(3):562-572.

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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