{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:32:34Z","timestamp":1771979554901,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T00:00:00Z","timestamp":1531872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB 912"],"award-info":[{"award-number":["SFB 912"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10288-018-0384-4","type":"journal-article","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T00:21:49Z","timestamp":1531959709000},"page":"173-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5428-9351","authenticated-orcid":false,"given":"John","family":"Martinovic","sequence":"first","affiliation":[]},{"given":"Markus","family":"H\u00e4hnel","sequence":"additional","affiliation":[]},{"given":"Guntram","family":"Scheithauer","sequence":"additional","affiliation":[]},{"given":"Waltenegus","family":"Dargie","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Fischer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"issue":"4","key":"384_CR1","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1721654.1721672","volume":"53","author":"M Armbrust","year":"2010","unstructured":"Armbrust M, Fox A, Griffith R, Joseph A, Katz R, Konwinski A, Lee G, Patterson D, Rabkin A, Stoica I et al (2010) A view of cloud computing. Commun ACM 53(4):50\u201358","journal-title":"Commun ACM"},{"key":"384_CR2","volume-title":"Linear programming and network flows","author":"MS Bazaraa","year":"2005","unstructured":"Bazaraa MS, Jarvis JJ, Sherali HD (2005) Linear programming and network flows, 3rd edn. Wiley, New York","edition":"3"},{"key":"384_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0471722227","volume-title":"A primer on statistical distributions","author":"N Balakrishnan","year":"2003","unstructured":"Balakrishnan N, Nevzorov VB (2003) A primer on statistical distributions, 1st edn. Wiley, New York","edition":"1"},{"issue":"13","key":"384_CR4","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1002\/cpe.1867","volume":"24","author":"A Beloglazov","year":"2012","unstructured":"Beloglazov A, Buyya R (2012) Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in cloud data centers. Concurr Comput Pract Exp 24(13):1387\u20131420","journal-title":"Concurr Comput Pract Exp"},{"issue":"1","key":"384_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ejor.2004.08.036","volume":"171","author":"G Belov","year":"2006","unstructured":"Belov G, Scheithauer G (2006) A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur J Oper Res 171(1):85\u2013106","journal-title":"Eur J Oper Res"},{"key":"384_CR6","unstructured":"Brand\u00e3o F (2016) VPSolver 3: multiple-choice vector packing solver. \n                    arXiv:1602.04876v1"},{"key":"384_CR7","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.11.009","volume":"69","author":"F Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o F, Pedroso JP (2016) Bin packing and related problems: general arc-flow formulation with graph compression. Comput Oper Res 69:56\u201367","journal-title":"Comput Oper Res"},{"issue":"1","key":"384_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.995","volume":"41","author":"R Calheiros","year":"2011","unstructured":"Calheiros R, Ranjan R, Beloglazov A, De Rose C, Buyya R (2011) CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Softw Pract Exp 41(1):23\u201350","journal-title":"Softw Pract Exp"},{"issue":"2","key":"384_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/TSC.2011.7","volume":"5","author":"S Chaisiri","year":"2012","unstructured":"Chaisiri S, Lee B-S, Niyato D (2012) Optimization of resource provisioning cost in cloud computing. IEEE Trans Serv Comput 5(2):164\u2013177","journal-title":"IEEE Trans Serv Comput"},{"key":"384_CR10","volume-title":"Probabilistic analysis of packing and partitioning algorithms","author":"EG Coffman Jr","year":"1991","unstructured":"Coffman EG Jr, Luecker GS (1991) Probabilistic analysis of packing and partitioning algorithms. Wiley, New York"},{"issue":"1","key":"384_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman Jr","year":"1978","unstructured":"Coffman EG Jr, Garey MR, Johnson DS (1978) An application of bin-packing to multiserver scheduling. SIAM J Comput 7(1):1\u201317","journal-title":"SIAM J Comput"},{"issue":"1","key":"384_CR12","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01180430","volume":"41","author":"H Cram\u00e9r","year":"1936","unstructured":"Cram\u00e9r H (1936) \u00dcber eine Eigenschaft der normalen Verteilungsfunktion. Math Z 41(1):405\u2013414","journal-title":"Math Z"},{"issue":"2","key":"384_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/MNET.2015.7064904","volume":"29","author":"M Dabbagh","year":"2015","unstructured":"Dabbagh M, Hamdaoui B, Guizani M (2015) Toward energy-efficient cloud computing: prediction, consolidation, and overcommitment. IEEE Netw 29(2):56\u201361","journal-title":"IEEE Netw"},{"issue":"5","key":"384_CR14","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1109\/TC.2014.2315629","volume":"64","author":"W Dargie","year":"2015","unstructured":"Dargie W (2015) A stochastic model for estimating the power consumption of a server. IEEE Trans Comput 64(5):1311\u20131322","journal-title":"IEEE Trans Comput"},{"key":"384_CR15","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"JMV Carvalho de","year":"1999","unstructured":"de Carvalho JMV (1999) Exact solution of bin-packing problems using column generation and branch-and-bound. Ann Oper Res 86:629\u2013659","journal-title":"Ann Oper Res"},{"issue":"2","key":"384_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0377-2217(02)00124-8","volume":"141","author":"JMV Carvalho de","year":"2002","unstructured":"de Carvalho JMV (2002) LP models for bin packing and cutting stock problems. Eur J Oper Res 141(2):253\u2013273","journal-title":"Eur J Oper Res"},{"key":"384_CR17","doi-asserted-by":"crossref","unstructured":"Delorme M, Iori M, Martello S (2015) Bin packing and cutting stock problems: mathematical models and exact algorithms. Research Report OR-15-1, University of Bologna","DOI":"10.1016\/j.ejor.2016.04.030"},{"key":"384_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme M, Iori M, Martello S (2016) Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur J Oper Res 255:1\u201320","journal-title":"Eur J Oper Res"},{"key":"384_CR19","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2013.09.007","volume":"510","author":"G D\u00f3sa","year":"2013","unstructured":"D\u00f3sa G, Li R, Han X, Tuza Z (2013) Tight absolute bound for first fit decreasing bin-packing: \n                    \n                      \n                    \n                    $$FFD(L) \\le 11\/9\\cdot OPT(L)+6\/9$$\n                    \n                      \n                        \n                          F\n                          F\n                          D\n                          (\n                          L\n                          )\n                          \u2264\n                          11\n                          \/\n                          9\n                          \u00b7\n                          O\n                          P\n                          T\n                          (\n                          L\n                          )\n                          +\n                          6\n                          \/\n                          9\n                        \n                      \n                    \n                  . Theor Comput Sci 510:13\u201361","journal-title":"Theor Comput Sci"},{"issue":"6","key":"384_CR20","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1287\/opre.29.6.1092","volume":"29","author":"H Dyckhoff","year":"1981","unstructured":"Dyckhoff H (1981) A new linear approach to the cutting stock problem. Oper Res 29(6):1092\u20131104","journal-title":"Oper Res"},{"key":"384_CR21","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1080\/0025570X.2008.11953577","volume":"81","author":"B Eisenberg","year":"2008","unstructured":"Eisenberg B, Sullivan R (2008) Why is the sum of independent normal random variables normal. Math Mag 81:362\u2013366","journal-title":"Math Mag"},{"key":"384_CR22","doi-asserted-by":"crossref","unstructured":"Ghosh S, Gebremedhin AH (2016) Parallelization of bin packing on multicore systems. In: Proceedings of the 23rd IEEE international conference on high performance computing (HiPC), pp 311\u2013320","DOI":"10.1109\/HiPC.2016.044"},{"key":"384_CR23","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem (part I). Oper Res 9:849\u2013859","journal-title":"Oper Res"},{"issue":"6","key":"384_CR24","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10951-016-0501-1","volume":"20","author":"L Grigoriu","year":"2017","unstructured":"Grigoriu L, Friesen DK (2017) Approximation for scheduling on uniform nonsimultaneous parallel machines. J Sched 20(6):593\u2013600","journal-title":"J Sched"},{"key":"384_CR25","unstructured":"Jin H, Pan D, Xu J, Pissinou N (2012) Efficient VM placement with multiple deterministic and stochastic resources in data centers. In: IEEE global communications conference (GLOBECOM), Anaheim, pp 2505\u20132510"},{"issue":"4","key":"384_CR26","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3(4):299\u2013325","journal-title":"SIAM J Comput"},{"key":"384_CR27","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/mnsc.6.4.366","volume":"6","author":"LV Kantorovich","year":"1939","unstructured":"Kantorovich LV (1939) Mathematical methods of organising and planning production. Manag Sci 6:366\u2013422 (Russian, 1960 English)","journal-title":"Manag Sci"},{"issue":"3","key":"384_CR28","doi-asserted-by":"publisher","first-page":"1489","DOI":"10.1007\/s11227-013-0939-2","volume":"66","author":"SG Kim","year":"2013","unstructured":"Kim SG, Eom H, Yeom H (2013) Virtual machine consolidation based on interference modeling. J Supercomput 66(3):1489\u20131506","journal-title":"J Supercomput"},{"key":"384_CR29","doi-asserted-by":"crossref","unstructured":"Lueker GS (1983) Bin packing with items uniformly distributed over intervals (a, b). In: 24th annual symposium on foundations of computer science, Tucson, pp 289\u2013297","DOI":"10.1109\/SFCS.1983.9"},{"issue":"2","key":"384_CR30","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.ejor.2017.10.008","volume":"266","author":"J Martinovic","year":"2018","unstructured":"Martinovic J, Scheithauer G, de Carvalho JMV (2018) A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. Eur J Oper Res 266(2):458\u2013471","journal-title":"Eur J Oper Res"},{"issue":"6","key":"384_CR31","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1109\/TPDS.2013.183","volume":"25","author":"C M\u00f6bius","year":"2014","unstructured":"M\u00f6bius C, Dargie W, Schill A (2014) Power consumption estimation models for servers, virtual machines, and servers. IEEE Trans Parallel Distrib Syst 25(6):1600\u20131614","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"7\u20138","key":"384_CR32","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1016\/j.dam.2011.10.037","volume":"160","author":"G Perboli","year":"2012","unstructured":"Perboli G, Tadei R, Baldi M (2012) The stochastic generalized bin packing problem. Discrete Appl Math 160(7\u20138):1291\u20131297","journal-title":"Discrete Appl Math"},{"issue":"7","key":"384_CR33","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/26.31166","volume":"37","author":"KW Ross","year":"1989","unstructured":"Ross KW, Tsang DHK (1989) The stochastic knapsack problem. IEEE Trans Commun 37(7):740\u2013747","journal-title":"IEEE Trans Commun"},{"issue":"6","key":"384_CR34","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<267::AID-JOS31>3.0.CO;2-H","volume":"2","author":"M Scharbrodt","year":"1999","unstructured":"Scharbrodt M, Steger A, Weisser H (1999) Approximability of scheduling with fixed jobs. J Sched 2(6):267\u2013284","journal-title":"J Sched"},{"key":"384_CR35","volume-title":"Introduction to cutting and packing optimization\u2014problems, modeling approaches, solution methods. International series in operations research and management science","author":"G Scheithauer","year":"2018","unstructured":"Scheithauer G (2018) Introduction to cutting and packing optimization\u2014problems, modeling approaches, solution methods. International series in operations research and management science, vol 263, 1st edn. Springer, Berlin","edition":"1"},{"key":"384_CR36","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/0377-2217(95)00022-I","volume":"84","author":"G Scheithauer","year":"1995","unstructured":"Scheithauer G, Terno J (1995) The modified integer round-up property of the one-dimensional cutting stock problem. Eur J Oper Res 84:562\u2013571","journal-title":"Eur J Oper Res"},{"key":"384_CR37","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1018346107246","volume":"9","author":"P Vance","year":"1998","unstructured":"Vance P (1998) Branch-and-price algorithms for the one-dimensional cutting stock problem. Comput Optim Appl 9:211\u2013228","journal-title":"Comput Optim Appl"},{"issue":"2","key":"384_CR38","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01300970","volume":"3","author":"P Vance","year":"1994","unstructured":"Vance P, Barnhart C, Johnson EL, Nemhauser GL (1994) Solving binary cutting stock problems by column generation and branch-and-bound. Comput Optim Appl 3(2):111\u2013130","journal-title":"Comput Optim Appl"},{"key":"384_CR39","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2016.2525984","author":"L Yu","year":"2016","unstructured":"Yu L, Chen L, Cai Z, Shen H, Liang Y, Pan Y (2016) Stochastic load balancing for virtual resource management in datacenters. IEEE Trans Cloud Comput. \n                    https:\/\/doi.org\/10.1109\/TCC.2016.2525984","journal-title":"IEEE Trans Cloud Comput"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0384-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-018-0384-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0384-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T19:38:24Z","timestamp":1568921904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-018-0384-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,18]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["384"],"URL":"https:\/\/doi.org\/10.1007\/s10288-018-0384-4","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,18]]},"assertion":[{"value":"2 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}