Skip to main content
SpringerLink
Log in

Vector bin packing with heterogeneous bins: application to the machine reassignment problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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 and in particular to build feasible solutions for the machine reassignment problem. We propose several families of greedy heuristics for this problem and show that they are flexible and can be adapted to handle additional constraints. We present structural properties of the machine reassignment problem, that allow us to decompose it into smaller subproblems and adapt our heuristics to them. We evaluate our heuristics on academic benchmarks of the vector bin packing problem, a randomly generated vector bin packing problem with heterogeneous bins benchmark as well as Google’s realistic instances of the machine reassignment problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  1. http://challenge.roadef.org/2012/en/.

  2. http://challenge.roadef.org/2012/files/Roadef-results.pdf.

  3. https://github.com/TeamJ19ROADEF2012/.

References

  • Aarts, E., & Lenstra, J. K. (1997). Local search in combinatorial optimization. Princeton: Princeton University Press.

    Google Scholar 

  • Bansal, N., Caprara, A., & Sviridenko, M. (2006). Improved approximation algorithms for multidimensional bin packing problems. In Foundations of Computer Science, IEEE (pp. 697–708).

  • Brandao, F., & Pedroso, J. P. (2013) Bin packing and related problems: General arc-flow formulation with graph compression. arXiv preprint (13106887).

  • Caprara, A., & Toth, P. (2001). Lower bounds and algorithms for the 2-dimensional vector packing problem. Discrete Applied Mathematics, 111(3), 231–262.

    Article  Google Scholar 

  • Caprara, A., Kellerer, H., & Pferschy, U. (2003). Approximation schemes for ordered vector packing problems. Naval Research Logistics, 50(1), 58–69.

    Article  Google Scholar 

  • Chang, S. Y., Hwang, H. C., & Park, S. (2005). A two-dimensional vector packing model for the efficient use of coil cassettes. Computers & Operations Research, 32(8), 2051–2058.

    Article  Google Scholar 

  • Chekuri, C., & Khanna, S. (1999) On multi-dimensional packing problems. In Symposium On Discrete Algorithms (pp. 185–194).

  • de Carvalho, J. M. V. (1999). Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research, 86, 629–659.

    Article  Google Scholar 

  • Falkenauer, E. (1996). A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2(1), 5–30.

    Article  Google Scholar 

  • Feo, T. A., & Resende, M. G. C. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8(2), 67–71.

    Article  Google Scholar 

  • Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(2), 109–133.

    Article  Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.

    Google Scholar 

  • Garey, M. R., Graham, R. L., Johnson, D. S., & Yao, A. C. (1976). Resource constrained scheduling as generalized bin packing. Journal of Combinatorial Theory, 21, 257–298.

    Article  Google Scholar 

  • Gavranović, H., Buljubašić, M., & Demirović, E. (2012). Variable neighborhood search for Google machine reassignment problem. Electronic Notes in Discrete Mathematics, 39, 209–216.

    Article  Google Scholar 

  • Han, B. T., Diehr, G., & Cook, J. S. (1994). Multiple-type, two-dimensional bin packing problems: Applications and algorithms. Annals of Operations Research, 50(1), 239–261.

    Article  Google Scholar 

  • Karp, R. M., Luby, M., & Marchetti-Spaccamela, A. (1984). A probabilistic analysis of multidimensional bin packing problems. In Symposium on Theory of Computing, ACM (pp. 289–298).

  • Kou, L. T., & Markowsky, G. (1977). Multidimensional bin packing algorithms. IBM Journal of Research and Development, 21(5), 443–448.

    Article  Google Scholar 

  • Lee, S., Panigrahy, R., Prabhakaran, V., Ramasubramanian, V., Talwar, K., Uyeda, L., & Wieder, U. (2011). Validating heuristics for virtual machines consolidation. Microsoft Research, MSR-TR-2011-9.

  • Leinberger, W., Karypis, G., & Kumar, V. (1999). Multi-capacity bin packing algorithms with applications to job scheduling under multiple constraints. In International Conference on Parallel Processing, IEEE (pp. 404–412).

  • Lopes, R., Morais, V. W., Noronha, T. F., & Souza, V. A. (2014). Heuristics and matheuristics for a real-life machine reassignment problem. International Transactions in Operational Research, 22(1), 77–95.

    Article  Google Scholar 

  • Maruyama, K., Chang, S., & Tang, D. (1977). A general packing algorithm for multidimensional resource requirements. International Journal of Computer & Information Sciences, 6(2), 131–149.

    Article  Google Scholar 

  • Mehta, D., O’Sullivan, B., & Simonis, H. (2012). Comparing solution methods for the machine reassignment problem. In M. Milano (Eds.), Principles and practice of constraint programming, Proceedings of 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012 (pp. 782–797). Berlin: Springer.

  • Panigrahy, R., Talwar, K., Uyeda, L., & Wieder, U. (2011). Heuristics for vector bin packing. Microsoft Research. Technical report.

  • Portal, G. M. (2013). An algorithmic study of the machine reassignment problem. Master’s thesis, Universidade Federal do Rio Grande do Sul.

  • Schoenfield, J. E. (2002). Fast, exact solution of open bin packing problems without linear programming. US Army Space and Missile Defense Command. Technical report.

  • Scholl, A., Klein, R., & Jürgens, C. (1997). Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research, 24(7), 627–645.

    Article  Google Scholar 

  • Shachnai, H., & Tamir, T. (2003). Approximation schemes for generalized 2-dimensional vector packing with application to data placement. In S. Arora, K. Jansen, J. D. P. Rolim, A. Sahai (Eds.), Approximation, randomization and combinatorial optimization. Algorithms and techniques: 6th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2003 and 7th international workshop on randomization and approximation techniquesin computer science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003. Proceedings (pp. 165–177). Berlin: Springer.

  • Spieksma, F. C. (1994). A branch-and-bound algorithm for the two-dimensional vector packing problem. Computers & Operations Research, 21(1), 19–25.

    Article  Google Scholar 

  • Stillwell, M., Schanzenbach, D., Vivien, F., & Casanova, H. (2010). Resource allocation algorithms for virtualized service hosting platforms. Journal of Parallel and Distributed Computing, 70(9), 962–974.

    Article  Google Scholar 

  • Woeginger, G. J. (1997). There is no asymptotic PTAS for two-dimensional vector packing. Information Processing Letters, 64(6), 293–297.

    Article  Google Scholar 

  • Yao, A. C. C. (1980). New algorithms for bin packing. Journal of the ACM, 27(2), 207–227.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Univ. Grenoble Alpes, G-SCOP, 38000, Grenoble, France

    Michaël Gabay

  2. CNRS, G-SCOP, 38000, Grenoble, France

    Michaël Gabay

  3. UJF, Inria Grenoble, 655 Avenue de l’Europe, Montbonnot, 38334, Saint Ismier Cedex, France

    Sofia Zaourar

Authors
  1. Michaël Gabay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sofia Zaourar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michaël Gabay.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gabay, M., Zaourar, S. Vector bin packing with heterogeneous bins: application to the machine reassignment problem. Ann Oper Res 242, 161–194 (2016). https://doi.org/10.1007/s10479-015-1973-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-015-1973-7

Keywords

Search

Navigation