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

On truthfulness and approximation for scheduling selfish tasks

โœ Scribed by Eric Angel; Evripidis Bampis; Fanny Pascual; Alex-Ariel Tchetgnia

Publisher
Springer US
Year
2009
Tongue
English
Weight
364 KB
Volume
12
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Complexity and approximation results for
Complexity and approximation results for scheduling multiprocessor tasks on a ring
โœ Giuseppe Confessore; Paolo Dell'Olmo; Stefano Giordani ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 398 KB

We study a multiprocessor task scheduling problem, in which each task requires a set of processors with consecutiveness constraints to be executed. This occurs, for example, when multiple processors are interconnected by communication means, and the minimization of communication time may require 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

An approximation result for a duo-proces
An approximation result for a duo-processor task scheduling problem
โœ P. Dell'Olmo; S. Giordani; M.G. Speranza ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 479 KB

We consider the problem of scheduling tasks on a set of dedicated processors, where each task requires a subset of two processors be simultaneously available for a given processing time. The objective is to determine a nonpreemptive schedule with minimum completion time. By means of a graph theoreti