Scheduling Jobs on Two Facilities to Minimize Makespan
研究在两台并行处理器上调度任务以最小化完工时间的问题，涵盖同速、比例和无关处理器等情形，并针对存在依赖约束的情况提出启发式方法，实验表明可处理较大规模问题。
This paper is concerned with the problem of scheduling tasks on a system consisting of two parallel processors in order that makespan be minimized. In particular, we treat a variety of modifications to this basic theme, including the cases of identical, proportional, and unrelated processors. In addition, a heuristic scheme is suggested when precedence constraints exist where such constraints may be assignment dependent. Substantial computational experience is reported in all cases where it would appear that relatively large problems can be handled routinely.