...
首页> 外文期刊>Journal of Combinatorial Optimization >Semi-online scheduling with known maximum job size on two uniform machines
【24h】

Semi-online scheduling with known maximum job size on two uniform machines

机译:在两台统一的计算机上以已知的最大作业大小进行半在线调度

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we investigate the semi-online scheduling problem with known maximum job size on two uniform machines with the speed ratio s≥1. The objective is to minimize the makespan. Two algorithms are presented, where the first is optimal for 1 £ s £ Ö21leq sleqsqrt{2} , and the second is optimal for 1.559≤s≤2 and s ³ frac3+Ö{17}2sge frac{3+sqrt{17}}{2} . In addition, the improvement on lower bounds is made for 2 < s < frac3+Ö{17}22
机译:在本文中,我们研究了速度比s≥1的两台均匀机器上具有最大作业规模的半在线调度问题。目的是使制造期最小化。提出了两种算法,第一种算法最适合于1£s£Ö21leqsleqsqrt {2},第二种算法最适合于1.559≤s≤2和s³frac3 +Ö{17} 2sge frac {3 + sqrt {17} } {2}。另外,针对2

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号