带服务器三台平行机排序问题复杂性和近似算法.pdfVIP

  • 10
  • 0
  • 约1.6万字
  • 约 7页
  • 2017-08-30 发布于安徽
  • 举报

带服务器三台平行机排序问题复杂性和近似算法.pdf

F 26 F 3 a g k U U Vol. 26 No. 3 2003 W 7 x ACTA MATHEMATICAE APPLICATAE SINICA July, 2003 GAJM FCQL VTU (IkVVvt 200237) S N XgBJZQBLifxBA U JgLU 1 EB GAIYPeyWAlAOHx MhHm eIjAfOpuaAejjJ = {j , j , · · · , j }, 1 2 n JejNbAfjGFAw nPeQvl GAIYPOHJfjejunjN jfFjejpO KsAmxmeftoPAj jejjmeftjsm KDOjIjeOHyGAIYPOHAo pJej AjsujPmftOjjIAs mIAjKiSrYxMOHhH m f y s efb m s, hHjj J = {j , j , · · · , j }, buaej 1 2 n ji AjJsjPEjPmef si A j ji PfERjjPmf pi A Ojj AjdedbKiRtnPO (s , p ) j i i i j . eOHefVPfej i fVjPejljAfVjjV ejQejVeffjO peOHxrnjAJCp 0, GAIYPOH KnnjAJp 0, QjAjCp 0, nApJ 2001 X6 y28 w2002 X5 y22 wMbd 3 a gBJZQBLzU 545 npeOHhOAWPHall C [1] O efAOHFWbnpj (ejjA j) eQv Hall CNOpnIeflnj AJCp 1 m P , S /s = 1/C bzK NP - TA 2 1 i max njAJCp s P , S /s = s/C k NP - T 2 1 i max A [2] Werner Ch P , S /s = 1/C AePDTOp 2 1 i max PIAmN P, S /s = 1/C k NP - TAYY 1 i max ym P, S /s = 1/C A LS Ty LPT TAOpOHmpf 1 i max fPcPxrnPpfAfjeju QNGAjSHmpfuAMrsPFfpC QVjGjq [3] EA blocking OHnFMA jNAjmpjuAfAjiQ CjAfQAjfj EAefAIYPOHQvj KAQeYP σ jAjEOpei IAMOV P , S //C

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档