OPTIMAL SEQUENCING OF 2 EQUIVALENT PROCESSORS

被引：82

作者：

FUJII, M

KASAMI, T

NINOMIYA, K

机构：

来源：

SIAM JOURNAL ON APPLIED MATHEMATICS | 1969年 / 17卷 / 04期

关键词：

D O I：

10.1137/0117070

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Paper presents an efficient algorithm for a class of sequencing problems in which n tasks with an arbitrary precedence relation have to be processed by two processors of equal ability, and each task requires one unit of time.

引用

页码：784 / &