两类特殊的在线分批排序问题.pdfVIP

  • 3
  • 0
  • 约3.61万字
  • 约 35页
  • 2019-05-21 发布于广东
  • 举报
A b st r a e t In th isPaP er,we m ain ly eonsider two sP ecialmo delson一line batch seheduling Problem . O n一line,in th is PaP er,m eans on一line一tim e. A ll job ,5 inform ation 15 unkno’w n b efore their release tim es ,an d on ee a job 15 seh edu led it eannot b e eh an ged . T he P arallelb ateh ing schedu lin g m ean s th at a m aeh in e ean Proeess severaljob s simu ltaneou sly as a b ateh ,an d alljob s in a bateh start and eom P lete at th e sam e tim e. T h e Proeessing tim e ofa b ateh 15 equ al to th e lon gest Proeessing tim e of th e job s assign ed to it. F irst o f a ll,w e inve stig a te th e sin g le m a eh in e P a ra lle l b a teh in g sch ed u lin g P ro b lem . T h e m a in resu lts o f th is P a P er are as follow s. (1)p roblem l}p 一石ateh :b 3 ;马 l:on 一ln‘e,r :‘lim ited restart,}Cm ax ·We show that there 15no on一line algorithm w ith eom petitive ratio lessthan 誉,and present a best P ossib le o n- lin e a lg o rith m . (2)P roblem l夕{ 一batch ,6 3 ;on 一l该n 。,r :‘l葱n ;ited restarts}C 讯“.We show that there 15noon一linealgorithm w ith eom petitiveratio lessthan 登,and presentan on-linealgorithm with eom petitive ratio 号· T hen ,we d iseu ss an on一lin e p arallel b ateh in g schedu lin g P rob lem w ith sp eeial job s. H ere,alljob s are on一line. T h ere are som e job s ,of w h ieh eaeh h as to seh edu le in a single b ateh resP eetive ly an d mu st b e P reeessed on ee it eom es. W e eall th em sP eeial job s,an d oth ers eom m on job s. T h e m a in resu lt、of th is P aP er are as follaw s. (l)P roblem l}spee乞alJo乙(restart);Pj 1:。 一l葱。e,r,,D }艺fj .We Show that there 15 no on一line algorithm w it

文档评论(0)

1亿VIP精品文档

相关文档