๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximation algorithm for multiprocessor parallel job scheduling

โœ Scribed by Chen, Song-qiao ;Huang, Jin-gui ;Chen, Jian-er

Book ID
107506003
Publisher
Chinese Electronic Periodical Services
Year
2002
Tongue
English
Weight
415 KB
Volume
9
Category
Article
ISSN
1005-9784

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A parallel approximation scheme for the
A parallel approximation scheme for the multiprocessor scheduling problem
โœ Ricardo C. Corrรชa ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 433 KB

In this paper, a parallel branch-and-bound approach for ยฎnding approximate solutions to a general version of the multiprocessor scheduling problem is presented and analyzed. In this approach, a list heuristic and a genetic algorithm are used to ยฎnd solutions to the subproblems enumerated during the

Approximation algorithms for general par
Approximation algorithms for general parallel task scheduling
โœ Oh-Heum Kwon; Kyung-Yong Chwa ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 281 KB

A general parallel task scheduling problem is considered. A task can be processed in parallel on one of several alternative subsets of processors. The processing time of the task depends on the subset of processors assigned to the task. We first show the hardness of approximating the problem for bot