Approximating the Non-contiguous Multiple Organization Packing Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Approximating the Non-contiguous Multiple Organization Packing Problem

Abstract

We present in this paper a -approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organizations (composed each of m identical processors) minimizing the maximum completion time (makespan). This algorithm runs in O(n(N + log(n))log(npmax)), where pmax is the maximum processing time of the jobs. It improves the best existing low cost approximation algorithms. Moreover, the proposed analysis can be extended to a more generic approach which suggests different job partitions that could lead to low cost approximation algorithms of ratio better than .
Fichier principal
Vignette du fichier
03230316.pdf (178.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01054450 , version 1 (06-08-2014)

Licence

Attribution

Identifiers

Cite

Marin Bougeret, Pierre François Dutot, Klaus Jansen, Christina Otte, Denis Trystram. Approximating the Non-contiguous Multiple Organization Packing Problem. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.316-327, ⟨10.1007/978-3-642-15240-5_23⟩. ⟨hal-01054450⟩
207 View
197 Download

Altmetric

Share

Gmail Facebook X LinkedIn More