期刊文献+

基于两步滚动的单机调度算法研究 被引量:1

Research on Single Machine Algorithm Based on Two-step Rolling
下载PDF
导出
摘要  提出了一种两步滚动的调度算法。一般情况下,与在线算法DELAY-SPT比较,滚动调度算法是比较优的。同时,也把两步滚动方法与一步滚动方法进行了比较,得出在一般情况下,两步滚动策略是较优的。 This paper introduces a sheduling algorithm based on two-step rolling. Generally, compared with on-line DELAY-SPT algorithm, the algorithm based on two-step rolling is superior. Compared with single-step rolling method, the two-step rolling method is also superior.
出处 《计算机工程》 CAS CSCD 北大核心 2004年第24期144-146,164,共4页 Computer Engineering
关键词 滚动调度 ELAY-SPT NEARLY on line算法 Rolling scheduling ELAY-SPT Nearly on line algorithm
  • 相关文献

参考文献10

  • 1Graham R L, Lawler E I, Lenstra J K, et al. Optimization and Approximation in Deterministic Sequencing and Scheduling:A Survey.Annals of Discrete Mathematics, 1979, (5): 287-326
  • 2Lenstra J K, Rinnooy Kan A H G, Brucker P. Complexity of Machine Scheduling Problems. Annals of Discrete Mathematics ,1977, ( 1 ): 343
  • 3Mao W, Kincaid R K. A Look-Ahead Heuristic for Scheduling Jobs With Release Date on a Single Machine. Computers and Operations Researeh, 1994, 21(10): 1041-1050
  • 4Goemans M X, Queyranne M , Schulz A S et al. Single Machine Scheduling with Release Dates. Report 654,Fachbereich Machcmatik, Technische Universitat Berlin,Germany, 1999
  • 5Sgall I. On-line Scheduting: A Survey. In: On-Line Algorithm: The State of the Art, Fiat A, Woeginger G(Eds.),Lccture Notes in Computer Science, Springer-Verlag, New York, 1998
  • 6Schmidt C. Scheduling with Limited Machine Availability. Eurpean Journal of Operational Research, 2000, 121: 1 - 15
  • 7Sahni S, Cho Y. Nearly on Line Scheduling of A Uniform Processor System with Release Times. Society for Industrial and Applied Mathmatics. 1979-05:275-285
  • 8Yamamoto M, NOF S Y. Scheduling-Reschcduling in the Manufacturing Operating System Environment INT. J. PROD. RES., 1985, 23(4): 705-722
  • 9Dessouky M I, Deogun J S. Sequencing Jobs with Uneaqual Ready Times to Minimize Mean Flow Time. SIAM J.COMPUT., 1981. 10(1)
  • 10Anderson E J, Potts C N. On-line Scheduling of a Single Machine to Minimize Total Weighted Completion Time. University of Southampton,2001-07-03

同被引文献14

  • 1韩晓龙,丁以中.集装箱港口泊位配置优化[J].系统工程理论方法应用,2006,15(3):275-278. 被引量:22
  • 2VIS I F A, DE KOSTER R, Transshipment of containers at a con- tainer terminal: An overview[ J]. European Journal of Operational Research, 2003, 147(1) : 1 - 16.
  • 3KIM K H, MOON K C. Berth scheduling by simulated annealing [J]. Transportation Research Part B: Methodological, 2003, 37 (6) : 541 -560.
  • 4PARK Y M, KIM K H. Berth scheduling for container terminal by using a sub-gradient optimization technique[ J]. Journal of Operation Research, 2002, 53(9) : 1054 - 1062.
  • 5IMAI A, NISHIMURAA E, PAPADIMITRIOU S. The dynamic berth allocation problem for a container port[ J]. Transportation Re- search Part B: Methodological, 2001, 35(4): 401-417.
  • 6IMAI A, CHEN H C, NISHIMUR E, et al. The simultaneous berth and quay crane allocation problem[ j]. Transportation Research Part E: Logistics and Transportation Review, 2008, 44(5): 900-920.
  • 7LEGATO P, GULLI D, TRUNFIO R. The quay crane deployment problem at a maritime container terminal[ EB/OL]. [ 2013-01-20]. http://www, scs-europe, net,/conf/ecms2008/ecms2008% 20CD/ ecms2008% 20pdf/ibs-ECMS2008_0106. pdf.
  • 8ZHEN L, LEE L H, CHEW E P. A decision model for berth alloca- tion under uncertainty [ J]. European Journal of Operational Re- search, 2012, 212(1): 54-68.
  • 9SAMMARRA M, CORDEAU J F, LAPORTE G, et al. A tabu search heuristic for the quay crane scheduling problem[ J]. Journal of Scheduling, 2007, 10(4/5) : 327 - 336.
  • 10TAVAKKOLI-MOGHADDAM R, MAKUI A, BAZZAZI M, et al. An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports[ J]. Computers and Industrial Engineering, 2009, 56( 1): 241 -248.

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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