About
Sign in
Join
An almost-optimal algorithm for the assembly line scheduling problem
Stanford University. Computer Science Department,
M. T. Kaufman
—
1973
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).
Buy
Want to read
Sign up to use
Share
0
Reviews
0
Highlights
0
Currently reading
0
Finished
0
Want to read