Sign in
Join Literal
An almost-optimal algorithm for the assembly line scheduling problem
Stanford University. Computer Science Department
Want to read
Sign up to use
Stanford University. Computer Science Department
An almost-optimal algorithm for the assembly line scheduling problem
Stanford University. Computer Science Department,
M. T. Kaufman
Want to read
Sign up to use
Want to read
Sign up to use
Overview
Reviews
Highlights
Editions
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).
Discover more books like An almost-optimal algorithm for the assembly line scheduling problem