首页 | 本学科首页   官方微博 | 高级检索  
     检索      

平行工件在线排序问题的下界
引用本文:高建军,秦小明,秦小锋,彭永爱.平行工件在线排序问题的下界[J].平顶山学院学报,2009,24(2).
作者姓名:高建军  秦小明  秦小锋  彭永爱
作者单位:1. 郑州防空兵指挥学院,河南,郑州,450052
2. 山西大学,山西,太原,030006
3. 山西临县兔坂镇政府,山西,临县,033214
4. 太原市小店区北格镇东蒲小学,山西,太原,030032
摘    要:通过分析模型Q2m|rj=0,mj,on-line-ncv|Cmax的特点,设计出了实例并证明了模型的下界为2-s/m(s+1),这一下界推广了1995年Shmoys,Wein和Williamso研究的模型Pm|rj,mj,on-line-ncv|Cmax的下界2-1/m.

关 键 词:平行工件  平行机  排序  快机器  慢机器

On-line Scheduling of Parallel Jobs on Uniform Machines with Two Different Speeds
GAO Jian-jun,QIN Xiao-ming,QIN Xiao-feng,PENG Yong-ai.On-line Scheduling of Parallel Jobs on Uniform Machines with Two Different Speeds[J].Journal of Pingdingshan University,2009,24(2).
Authors:GAO Jian-jun  QIN Xiao-ming  QIN Xiao-feng  PENG Yong-ai
Institution:1.Air Defence Command College of Zhengzhou;Zhengzhou;Henan 450052;China;2.Shanxi University;Taiyuan;Shanxi 030006;3.Tuban Town Government;Linxian;Shanxi 033214;4.Dongpu Elementary School;Shanxi 030032;China
Abstract:Based on the characteristics of the model Q2m|rj=0,mj,on-line-ncv|Cmax,lower bound was designed to be 2-s/m(s+1),and this lower bound extended the Shemoys,Wein and Williamso's 2-1/m for the model Pm|rj,mj,on-line-ncv|Cmax in 1995.
Keywords:parallel job  parallel machine  scheduling  fast machine  slow machine  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号