We present in this paper a 5/2-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 5/2. © IFIP International Federation for Information Processing 2010.
CITATION STYLE
Bougeret, M., Dutot, P. F., Jansen, K., Otte, C., & Trystram, D. (2010). Approximating the non-contiguous multiple organization packing problem. IFIP Advances in Information and Communication Technology, 323 AICT, 316–327. https://doi.org/10.1007/978-3-642-15240-5_23
Mendeley helps you to discover research relevant for your work.