正在加载图片...
Scheduling m machines n jobs with processing time Pj Completion time: C=∑ j:jobs assigned to machine i Makespan: max ma <Ci 1≤i达Scheduling n jobs m machines processing time pj with Completion time: Makespan: Ci = j: job ∑ s assigned to machine i pj Cmax = max 1≤i≤ Ci
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有