您好,欢迎光临本网站![请登录][注册会员]  

搜索资源列表

  1. Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time

  2. *平行分批机器上的最小化最大流程的在线排序,李文华,原晋江,This paper considers online scheduling on m unbounded parallel-batch machines to minimize maximum flow-time of the jobs. The research shows that no online algorithm can have a comp
  3. 所属分类:其它

    • 发布日期:2020-02-07
    • 文件大小:191kb
    • 提供者:weixin_38746926