期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

A new polynomial algorithm for a parallelidentical scheduling problem

A new polynomial algorithm for a parallel identical scheduling problem
在线阅读 下载PDF
导出
摘要 A precedence order is defined based on the release dates of jobs＇ direct successors. Using the defined precedence order and Heap Sort, a new polynomial algorithm is provided which aims to solve the parallel scheduling problem P｜pj = 1, r j, outtree｜ ∑Cj Cj. The new algorithm is shown to be more compact and easier to implement. A precedence order is defined based on the release dates of jobs＇ direct successors. Using the defined precedence order and Heap Sort, a new polynomial algorithm is provided which aims to solve the parallel scheduling problem P｜pj = 1, r j, outtree｜ ∑Cj Cj. The new algorithm is shown to be more compact and easier to implement.
作者 Yumei LI Hongxing LI Vincent C. YEN
机构地区 School of Information Engineering School of Mathematical Sciences Department of Management Science and Information Systems
出处 《控制理论与应用（英文版）》 EI 2007年第4期345-350,共6页
基金 This work was supported by the National Natural Science Foundation of China(No.60474023) Science and Technology Key Project Fund of theMinistry of Education(No.03184) the Major State Basic Research Development Program of China(No.2002CB312200).
关键词 Scheduling problem Precedence order Heap sort ALGORITHM Scheduling problem Precedence order Heap sort Algorithm
分类号 TP13 [自动化与计算机技术—控制理论与控制工程]
  • 相关文献

参考文献17

  • 1Philippe Baptiste,Peter Brucker,Marek Chrobak,Christoph Dürr,Svetlana A. Kravchenko,Francis Sourd.The complexity of mean flow time scheduling problems with release times[J].Journal of Scheduling.2007(2)
  • 2Yumei Huo,Joseph Y. -T. Leung.Minimizing total completion time for UET tasks with release time and outtree precedence constraints[J].Mathematical Methods of Operations Research.2005(2)
  • 3Philippe Baptiste,Vadim G. Timkovsky.Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time[J].Mathematical Methods of Operational Research.2004(1)
  • 4Philippe Baptiste,Peter Brucker,Sigrid Knust,Vadim G. Timkovsky.Ten notes on equal-processing-time scheduling[J].Quarterly Journal of the Belgian French and Italian Operations Research Societies.2004(2)
  • 5E. G. Coffman,J. Sethuraman,V. G. Timkovsky.Ideal preemptive schedules on two processors[J].Acta Informatica.2003(8)
  • 6Peter Brucker,Johann Hurink,Sigrid Knust.A polynomial algorithm for P | pj=1, rj, outtree | ∑ Cj[J].Mathematical Methods of Operations Research.2003(3)
  • 7Ass. Prof. E. G. Coffman,Dr. R. L. Graham.Optimal scheduling for two-processor systems[J].Acta Informatica.1972(3)
  • 8Jr.E.G Coffman,J.Sethuraman,V.G.Timkovsky.Ideal preemptive schedules on two processors[].Acta Infomatica.2003
  • 9P.Baptiste,P Brucker,S.Knust,V.G.Timkovsky.Ten notes on equal-execution-time scheduling[].Quarterly Journal of Operations Research.2004
  • 10B.Simons.Multiprocessor scheduling of unit-time jobs with arbitrary release dates and deadlines[].SIAM Journal on Computing.1983
控制理论与应用（英文版）
2007年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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