An almost-optimal algorithm for the assembly line scheduling problem

An almost-optimal algorithm for the assembly line scheduling problem

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).
Sign up to use