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 .

[1]  Sergey Zhuk Approximate algorithms to pack rectangles into several strips , 2006 .

[2]  Klaus Jansen,et al.  Approximation Algorithms for Multiple Strip Packing , 2009, WAOA.

[3]  Pierre-François Dutot,et al.  Scheduling Parallel Tasks Approximation Algorithms , 2004, Handbook of Scheduling.

[4]  Klaus Jansen,et al.  New Approximability Results for 2-Dimensional Packing Problems , 2007, MFCS.

[5]  Ingo Schiermeyer,et al.  Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles , 1994, ESA.

[6]  Maxime Crochemore,et al.  Finding Patterns In Given Intervals , 2007, Fundam. Informaticae.

[7]  Krzysztof Rzadca,et al.  Approximation Algorithms for the Multi-Organization Scheduling Problem , 2011 .

[8]  Ronald L. Graham,et al.  Bounds for Multiprocessor Scheduling with Resource Constraints , 1975, SIAM J. Comput..

[9]  Krzysztof Rzadca,et al.  Approximation Algorithms for the Multiorganization Scheduling Problem , 2011, IEEE Transactions on Parallel and Distributed Systems.

[10]  David B. Shmoys,et al.  A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1988, SIAM J. Comput..

[11]  Jan van Leeuwen,et al.  Algorithms — ESA '94 , 1994, Lecture Notes in Computer Science.

[12]  A. Steinberg,et al.  A Strip-Packing Algorithm with Absolute Performance Bound 2 , 1997, SIAM J. Comput..

[13]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[14]  Claire Mathieu,et al.  A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem , 2000, Math. Oper. Res..

[15]  Guochuan Zhang,et al.  Online multiple-strip packing , 2009, Theor. Comput. Sci..

[16]  Uwe Schwiegelshohn,et al.  Online scheduling in grids , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.