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

A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling

โœ Scribed by Chen, Jianer; Miranda, Antonio

Book ID
118180470
Publisher
Society for Industrial and Applied Mathematics
Year
2001
Tongue
English
Weight
215 KB
Volume
31
Category
Article
ISSN
0097-5397

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

A polynomial time approximation scheme f
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
โœ Petra Schuurman; Gerhard J. Woeginger ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 148 KB

In this paper we investigate the two-stage multiprocessor ow shop scheduling problem F2(P)| โ€ข |Cmax, where the numbers m1 and m2 of machines available in the two stages are part of the input. We demonstrate the existence of a polynomial time approximation scheme for this problem. This result solves