期刊文献+

处理机具有准备时间的排序问题Pm,a_i‖∑C_j 被引量:3

The scheduling problem with processor ready time Pm,a_i‖∑C_j
下载PDF
导出
摘要 讨论处理机具有准备时间的同速机排序问题Pm ,a_i‖∑ C_j.证明了SPT排序是最优排序 . In this paper we discuss the nonpreemptive identical processor′s scheduling problem Pm,a\-i‖C j.We prove that the SPT schedule is optimal schedule.
作者 赵玉芳
出处 《沈阳师范学院学报(自然科学版)》 CAS 2002年第4期247-249,共3页 Journal of Shenyang Normal University(Natural Science)
基金 辽宁省教育厅高等学校科学研究项目 (2 0 2 6 2 2 5 0 )
关键词 最优排序 SPT算法 处理机 证明 schedule optimal schedule SPT algorithm
  • 相关文献

参考文献6

二级参考文献6

共引文献9

同被引文献16

  • 1赵玉芳,唐立新.极小化最大完工时间的单机连续型批调度问题[J].自动化学报,2006,32(5):730-737. 被引量:18
  • 2TANG Lixin,LIU Jiyin,RONG Aiying,et al.A Review of Planning and Scheduling Systems and Methods for Integrated Steel Production[J].European Journal of Operational Research,2001,133(1):1-20.
  • 3IKURA Y,GIMPLE M.Scheduling algorithms for a single batch processing machine[J].Operations Research Letters,1986,5(1):61-65.
  • 4LEE C Y,UZSOY R,MARTIN-VEGA L A.Efficient Algorithms for Scheduling Semiconductor Burn-in Operations[J].Operations Research,1992,40(4):764-775.
  • 5UZSOY R,LEE C Y,MARTIN-VEGA L A.Scheduling semiconductor test operations:Minimizing maximum lateness and number of tardy jobs on a single machine[J].Naval Research Logistics,1992,39(3):369-388.
  • 6BRUCKER P,GAREY N R,JOHNSON D S.Scheduling equal-length tasks under tree-like precedence constraints to minimize maximum lateness[J].Mathematics of Operations Research,1977,2(2):275-284.
  • 7ALBERS S,BRUCKER P.The complexity of one-machine batching problems[J].Discrete Applied Mathematics,1993,47(1):87-107.
  • 8COFFMAN E G J R,YANNAKAKIS M,MAGAZINE M J,et al.Batch sizing and job sequencing on a single machine[J].Annals of Operations Research,1990,26(1):135-147.
  • 9BRUCKER P,KOVALYOV M Y.Single machine batch scheduling to minimize the weighted number of late jobs[J].Mathematical Methods of Operations Research,1996,43(1):1-8.
  • 10NG C T,CHENG T C E,YUAN Jinjiang,et al.On the single machine serial batching scheduling problem to minimize total complete on time with precedence constraints,release dates and identical processing times[J].Operations Research Letters,2003,31(6):323-326.

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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