Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a Open image in new window -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(np max )), where p max 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 Open image in new window .
KeywordsPacking Problem Strip Packing Algorithmic Cost Strip Packing Problem Global List
- 5.Kenyon, C., Rémila, E.: A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research, 645–656 (2000)Google Scholar
- 7.Ye, D., Han, X., Zhang, G.: On-Line Multiple-Strip Packing. In: Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications, p. 165. Springer, Heidelberg (2009)Google Scholar
- 10.Schwiegelshohn, U., Tchernykh, A., Yahyapour, R.: Online scheduling in grids. In: Proceedings of IPDPS, pp. 1–10 (2008)Google Scholar
- 11.Dutot, P.-F., Pascual, F., Rzadca, K., Trystram, D.: Approximation algorithms for the multi-organization scheduling problem. IEEE Transactions on Parallel and Distributed Systems, TPDS (2010) (submitted )Google Scholar
- 12.Dutot, P.-F., Mounié, G., Trystram, D.: Scheduling Parallel Tasks: Approximation Algorithms. In: Handbook of Scheduling. CRC Press, Boca Raton (2004)Google Scholar