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)