Scheduling Unrelated Parallel Machines- Algorithms Complexity And Performa

CN¥524.00
+ CN¥147.49 送货

Scheduling Unrelated Parallel Machines- Algorithms Complexity And Performa

由……售出:

CN¥524.00

有货
+ CN¥147.49 送货

14天退货政策

付款方式:


产品详情

产品详情

Scheduling Unrelated Parallel Machines- Algorithms Complexity And Performa

A Bank Of Parallel Machines Is An Important Setting In Computer Science. When Dealing With Parallel Machines, The Minimization Of The Maximal Load (makespan) Becomes An Objective Of Significant Interest. In Practice One Often Has To Balance The Load On Parallel Machines, E.g., On Computer Processors.
  • Fruugo ID: 557279352-1125549316
  • ISBN: 9783836446488
配送

送货

在 24 小时内发货

  • STANDARD: CN¥147.49 - 之间的交付 周三 18 十一月 2026–周三 16 十二月 2026

从 英国 送货。

退货

退货

我们会争取将您订购的产品按照您的规格完整地配送给您。不过,万一您收到不完整的订单,或收到的产品与您订购的不同,或者有其他原因让您对订单不满意,您可以要求全部或部分退货,您将收到相应产品的全额退款。

查看完整的退货政策