Variable size vector bin packing heuristics - Application to the machine reassignment problem

In this paper, we introduce a generalization of the vector bin packing problem, where the bins have variable sizes. This generalization can be used to model virtual machine placement problems. In particular, we study the machine reassignment problem. We propose several greedy heuristics for the variable size vector bin packing problem and show that they are flexible and can be adapted to handle additional constraints. We highlight some structural properties of the machine reassignment problem and use them to adapt our heuristics. We present numerical results on both randomly generated instances and Google realistic instances for the machine reassignment problem.

[1]  Rina Panigrahy,et al.  Heuristics for Vector Bin Packing , 2011 .

[2]  George Markowsky,et al.  Multidimensional Bin Packing Algorithms , 1977, IBM J. Res. Dev..

[3]  Soo Y. Chang,et al.  A two-dimensional vector packing model for the efficient use of coil cassettes , 2005, Comput. Oper. Res..

[4]  Alberto Caprara,et al.  Improved approximation algorithms for multidimensional bin packing problems , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[5]  Andrew Chi-Chih Yao,et al.  Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.

[6]  S. K. Chang,et al.  A general packing algorithm for multidimensional resource requirements , 1977, International Journal of Computer & Information Sciences.

[7]  Bernard T. Han,et al.  Multiple-type, two-dimensional bin packing problems: Applications and algorithms , 1994, Ann. Oper. Res..

[8]  Richard M. Karp,et al.  A probabilistic analysis of multidimensional bin packing problems , 1984, STOC '84.

[9]  Sanjeev Khanna,et al.  On multi-dimensional packing problems , 2004, SODA '99.

[10]  Rina Panigrahy,et al.  Validating Heuristics for Virtual Machines Consolidation , 2011 .

[11]  Hans Kellerer,et al.  Approximation schemes for ordered vector packing problems , 2001, RANDOM-APPROX.

[12]  Henri Casanova,et al.  Resource allocation algorithms for virtualized service hosting platforms , 2010, J. Parallel Distributed Comput..

[13]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[14]  Paolo Toth,et al.  Lower bounds and algorithms for the 2-dimensional vector packing problem , 2001, Discret. Appl. Math..

[15]  Gerhard J. Woeginger,et al.  There is no Asymptotic PTAS for Two-Dimensional Vector Packing , 1997, Inf. Process. Lett..

[16]  Andrew Chi-Chih Yao,et al.  New Algorithms for Bin Packing , 1978, JACM.

[17]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[18]  Hadas Shachnai,et al.  Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement , 2003, RANDOM-APPROX.

[19]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[20]  Vipin Kumar,et al.  Multi-capacity bin packing algorithms with applications to job scheduling under multiple constraints , 1999, Proceedings of the 1999 International Conference on Parallel Processing.