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

Approximation Algorithms for Scheduling with

โœ Scribed by Florian Diedrich; Klaus Jansen; Fanny Pascual; Denis Trystram

Publisher
Springer
Year
2009
Tongue
English
Weight
474 KB
Volume
58
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximation algorithms for shop schedu
Approximation algorithms for shop scheduling problems with minsum objective
โœ Maurice Queyranne; Maxim Sviridenko ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer US ๐ŸŒ English โš– 166 KB

We consider a general class of multiprocessor shop scheduling problems, preemptive or non-preemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We

Approximation algorithms for scheduling
Approximation algorithms for scheduling trees with general communication delays
โœ Alix Munier ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 101 KB

We consider the problem of scheduling a tree with general communication delays. Jakoby and Reischuk proved that this problem is NP-hard for binary trees and unlimited number of processors. Firstly, we develop a clustering procedure based on the same lower bounds as Papadimitriou and Yannakakis for a