An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem.
Technical rept. no. 53,
STANFORD UNIV CALIF STANFORD ELECTRONICS LABS
Pagination or Media Count:
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
- Operations Research
- Computer Hardware