{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:50:17Z","timestamp":1767340217896},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,7]],"date-time":"2015-09-07T00:00:00Z","timestamp":1441584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10479-015-1973-7","type":"journal-article","created":{"date-parts":[[2015,9,7]],"date-time":"2015-09-07T05:54:27Z","timestamp":1441605267000},"page":"161-194","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["Vector bin packing with heterogeneous bins: application to the machine reassignment problem"],"prefix":"10.1007","volume":"242","author":[{"given":"Micha\u00ebl","family":"Gabay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sofia","family":"Zaourar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,7]]},"reference":[{"key":"1973_CR1","volume-title":"Local search in combinatorial optimization","author":"E Aarts","year":"1997","unstructured":"Aarts, E., & Lenstra, J. K. (1997). Local search in combinatorial optimization. Princeton: Princeton University Press."},{"key":"1973_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Caprara, A., & Sviridenko, M. (2006). Improved approximation algorithms for multidimensional bin packing problems. In Foundations of Computer Science, IEEE (pp. 697\u2013708).","DOI":"10.1109\/FOCS.2006.38"},{"key":"1973_CR3","unstructured":"Brandao, F., & Pedroso, J. P. (2013) Bin packing and related problems: General arc-flow formulation with graph compression. arXiv preprint (13106887)."},{"issue":"3","key":"1973_CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0166-218X(00)00267-5","volume":"111","author":"A Caprara","year":"2001","unstructured":"Caprara, A., & Toth, P. (2001). Lower bounds and algorithms for the 2-dimensional vector packing problem. Discrete Applied Mathematics, 111(3), 231\u2013262.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"1973_CR5","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1002\/nav.10058","volume":"50","author":"A Caprara","year":"2003","unstructured":"Caprara, A., Kellerer, H., & Pferschy, U. (2003). Approximation schemes for ordered vector packing problems. Naval Research Logistics, 50(1), 58\u201369.","journal-title":"Naval Research Logistics"},{"issue":"8","key":"1973_CR6","doi-asserted-by":"crossref","first-page":"2051","DOI":"10.1016\/j.cor.2004.01.006","volume":"32","author":"SY Chang","year":"2005","unstructured":"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\u20132058.","journal-title":"Computers & Operations Research"},{"key":"1973_CR7","unstructured":"Chekuri, C., & Khanna, S. (1999) On multi-dimensional packing problems. In Symposium On Discrete Algorithms (pp. 185\u2013194)."},{"key":"1973_CR8","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"JMV Carvalho de","year":"1999","unstructured":"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\u2013659.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"1973_CR9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer, E. (1996). A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2(1), 5\u201330.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"1973_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T. A., & Resende, M. G. C. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8(2), 67\u201371.","journal-title":"Operations Research Letters"},{"issue":"2","key":"1973_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(2), 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"1973_CR12","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman."},{"key":"1973_CR13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"MR Garey","year":"1976","unstructured":"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\u2013298.","journal-title":"Journal of Combinatorial Theory"},{"key":"1973_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.endm.2012.10.028","volume":"39","author":"H Gavranovi\u0107","year":"2012","unstructured":"Gavranovi\u0107, H., Buljuba\u0161i\u0107, M., & Demirovi\u0107, E. (2012). Variable neighborhood search for Google machine reassignment problem. Electronic Notes in Discrete Mathematics, 39, 209\u2013216.","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"1973_CR15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02085642","volume":"50","author":"BT Han","year":"1994","unstructured":"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\u2013261.","journal-title":"Annals of Operations Research"},{"key":"1973_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013298).","DOI":"10.1145\/800057.808693"},{"issue":"5","key":"1973_CR17","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1147\/rd.215.0443","volume":"21","author":"LT Kou","year":"1977","unstructured":"Kou, L. T., & Markowsky, G. (1977). Multidimensional bin packing algorithms. IBM Journal of Research and Development, 21(5), 443\u2013448.","journal-title":"IBM Journal of Research and Development"},{"key":"1973_CR18","unstructured":"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."},{"key":"1973_CR19","doi-asserted-by":"crossref","unstructured":"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\u2013412).","DOI":"10.1109\/ICPP.1999.797428"},{"issue":"1","key":"1973_CR20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1111\/itor.12063","volume":"22","author":"R Lopes","year":"2014","unstructured":"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\u201395.","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"1973_CR21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00999302","volume":"6","author":"K Maruyama","year":"1977","unstructured":"Maruyama, K., Chang, S., & Tang, D. (1977). A general packing algorithm for multidimensional resource requirements. International Journal of Computer & Information Sciences, 6(2), 131\u2013149.","journal-title":"International Journal of Computer & Information Sciences"},{"key":"1973_CR22","doi-asserted-by":"crossref","unstructured":"Mehta, D., O\u2019Sullivan, 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\u00e9bec City, QC, Canada, October 8-12, 2012 (pp. 782\u2013797). Berlin: Springer.","DOI":"10.1007\/978-3-642-33558-7_56"},{"key":"1973_CR23","unstructured":"Panigrahy, R., Talwar, K., Uyeda, L., & Wieder, U. (2011). Heuristics for vector bin packing. Microsoft Research. Technical report."},{"key":"1973_CR24","unstructured":"Portal, G. M. (2013). An algorithmic study of the machine reassignment problem. Master\u2019s thesis, Universidade Federal do Rio Grande do Sul."},{"key":"1973_CR25","unstructured":"Schoenfield, J. E. (2002). Fast, exact solution of open bin packing problems without linear programming. US Army Space and Missile Defense Command. Technical report."},{"issue":"7","key":"1973_CR26","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"A Scholl","year":"1997","unstructured":"Scholl, A., Klein, R., & J\u00fcrgens, C. (1997). Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research, 24(7), 627\u2013645.","journal-title":"Computers & Operations Research"},{"key":"1973_CR27","unstructured":"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\u2013177). Berlin: Springer."},{"issue":"1","key":"1973_CR28","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0305-0548(94)90059-0","volume":"21","author":"FC Spieksma","year":"1994","unstructured":"Spieksma, F. C. (1994). A branch-and-bound algorithm for the two-dimensional vector packing problem. Computers & Operations Research, 21(1), 19\u201325.","journal-title":"Computers & Operations Research"},{"issue":"9","key":"1973_CR29","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1016\/j.jpdc.2010.05.006","volume":"70","author":"M Stillwell","year":"2010","unstructured":"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\u2013974.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"6","key":"1973_CR30","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0020-0190(97)00179-8","volume":"64","author":"GJ Woeginger","year":"1997","unstructured":"Woeginger, G. J. (1997). There is no asymptotic PTAS for two-dimensional vector packing. Information Processing Letters, 64(6), 293\u2013297.","journal-title":"Information Processing Letters"},{"issue":"2","key":"1973_CR31","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"ACC Yao","year":"1980","unstructured":"Yao, A. C. C. (1980). New algorithms for bin packing. Journal of the ACM, 27(2), 207\u2013227.","journal-title":"Journal of the ACM"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1973-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-1973-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1973-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:10:02Z","timestamp":1559139002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-1973-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,7]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["1973"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-1973-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,7]]}}}