An almost-optimal algorithm for the assembly line scheduling problem

Front Cover
Digital Systems Laboratory, Stanford Electronics Laboratories, Stanford University, 1973 - Multiprocessors - 24 pages
0 Reviews
The paper considers a solution to the multiprocessor scheduling problem for the case where the ordering relation between tasks can be represented as a tree. (Modified author abstract).

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Common terms and phrases

Bibliographic information