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(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 .
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Zhuk, S.: Approximate algorithms to pack rectangles into several strips. Discrete Mathematics and Applications 16(1), 73–85 (2006)
Coffman Jr., E., Garey, M., Johnson, D., Tarjan, R.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput. 9, 808 (1980)
Schiermeyer, I.: Reverse-fit: A 2-optimal algorithm for packing rectangles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 290–299. Springer, Heidelberg (1994)
Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing 26, 401 (1997)
Kenyon, C., Rémila, E.: A near-optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research, 645–656 (2000)
Jansen, K., Solis-Oba, R.: New approximability results for 2-dimensional packing problems. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, p. 103. Springer, Heidelberg (2007)
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)
Bougeret, M., Dutot, P.-F., Jansen, K., Otte, C., Trystram, D.: Approximation algorithms for multiple strip packing. In: Bampis, E., Jansen, K. (eds.) Approximation and Online Algorithms. LNCS, vol. 5893, pp. 37–48. Springer, Heidelberg (2010)
Garey, M., Graham, R.: Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput. 4(2), 187–200 (1975)
Schwiegelshohn, U., Tchernykh, A., Yahyapour, R.: Online scheduling in grids. In: Proceedings of IPDPS, pp. 1–10 (2008)
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 )
Dutot, P.-F., Mounié, G., Trystram, D.: Scheduling Parallel Tasks: Approximation Algorithms. In: Handbook of Scheduling. CRC Press, Boca Raton (2004)
Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput. 17(3), 539–551 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP
About this paper
Cite this paper
Bougeret, M., Dutot, P.F., Jansen, K., Otte, C., Trystram, D. (2010). Approximating the Non-contiguous Multiple Organization Packing Problem. In: Calude, C.S., Sassone, V. (eds) Theoretical Computer Science. TCS 2010. IFIP Advances in Information and Communication Technology, vol 323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15240-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-15240-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15239-9
Online ISBN: 978-3-642-15240-5
eBook Packages: Computer ScienceComputer Science (R0)