Counterexample to a Conjecture of Fujii, Kasami and Ninomiya.

Abstract

In a recent paper, Fujii, Kasami and Ninomiya presented a procedure for the optimal scheduling of a system of unit length tasks represented as a directed acyclic graph on two identical processors. The authors conjecture that the algorithm can be extended to the case where more than two processors are employed. The note presents a counterexample to that conjecture. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1972
Accession Number
AD0749848

Entities

People

  • Marc T. Kaufman

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Engineering
  • Mathematics
  • Production Engineering
  • Scheduling (Production)

Fields of Study

  • Mathematics

Readers

  • Artificial Intelligence
  • Educational Psychology
  • Operations Research