Ali, H. and El-Rewini, H. (1993) The Time Complexity of Scheduling Interval Orders with Communication Is Polynomial. Parallel Processing Letters, 3, 53-58.
http://dx.doi.org/10.1142/S0129626493000083

has been cited by the following article:

• TITLE: An O(n) Time Algorithm for Scheduling UET-UCT of Bipartite Digraphs of Depth One on Two Processors

  AUTHORS: Ruzayn Quaddoura

  KEYWORDS: Scheduling, Makespan, Precedence Constraints, Bipartite Graph, Optimal Algorithm

  JOURNAL NAME: American Journal of Operations Research, Vol.6 No.1, January 28, 2016

  ABSTRACT: Given n unit execution time (UET) tasks whose precedence constraints form a directed acyclic graph, the arcs are associated with unit communication time (UCT) delays. The problem is to schedule the tasks on two identical processors in order to minimize the makespan. Several polynomial algorithms in the literature are proposed for special classes of digraphs, but the complexity of solving this problem in general case is still a challenging open question. We present in this paper an O(n) time algorithm to compute an optimal schedule for the class of bipartite digraphs of depth one.