Title:
dulirewuzuiyoudiaoduwenti
Download
Description: A processor with 2 sets and B n-job treatment. I-month operation designed to machine A processing takes time ai, if handled by the machine B, you need time bi. As a result of the machine operating characteristics and performance relationship, it is possible for some i, there is ai> = bi, and for some j, j ≠ i, there is aj <bj，既不能将一个作业分开由2 台机器处理，也没有一台机器能同时处理2 个作业。设计一个动态规划算法，使得这2 台机器处理完这n个作业的时间最短(从任何一台机器开工到最后一台机器停工的总时间)。
To Search:
- [suanfa] - Set A and B are two strings. Operation w
File list (Check if you may need any files):
独立任务最优调度问题\input0.txt
....................\input1.txt
....................\input2.txt
....................\output.txt
....................\独立任务最优调度问题.cpp
....................\独立任务最优调度问题1.cpp
独立任务最优调度问题
