Sign inJoin
An almost-optimal algorithm for the assembly line scheduling problem
Sign up to use

Audiobook

Libro.fmAudiobooks.com

We may earn a commission. Learn more.

An almost-optimal algorithm for the assembly line scheduling problem

Stanford University. Computer Science Department, M. T. Kaufman — 1973
Sign up to use
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).

Audiobook

Libro.fmAudiobooks.com

We may earn a commission. Learn more.

No reviews yet.
Be the first to write one.

No highlights yet.
Be the first to share one.