Efficient Network Solutions to Parallel Processor Scheduling Problems: A Survey.

摘要

Parallel processor scheduling problems are special in that they assume no ordering among machines. Most of the scheduling problems for which there exist efficient algorithms are included in this class. In many of the well-solved problems of this area, network formulations are explicit or at least possible. We survey parallel processor scheduling from the thematic viewpoint of efficient network solutions. (Author)