Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation

Based on an application in the field of server consolidation, we consider the one-dimensional cutting stock problem with nondeterministic item lengths. After a short introduction to the general topic we investigate the case of normally distributed item lengths in more detail. Within this framework, we present two lower bounds as well as two heuristics to obtain upper bounds, where the latter are either based on a related (ordinary) cutting stock problem or an adaptation of the first fit decreasing heuristic to the given stochastical context. For these approximation techniques, dominance relations are discussed, and theoretical performance results are stated. As a main contribution, we develop a characterization of feasible patterns by means of one linear and one quadratic inequality. Based on this, we derive two exact modeling approaches for the nondeterministic cutting stock problem, and provide results of numerical simulations.

[1]  Harald Dyckhoff,et al.  A New Linear Programming Approach to the Cutting Stock Problem , 1981, Oper. Res..

[2]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[3]  Sayan Ghosh,et al.  Parallelization of Bin Packing on Multicore Systems , 2016, 2016 IEEE 23rd International Conference on High Performance Computing (HiPC).

[4]  N. Balakrishnan,et al.  A Primer on Statistical Distributions , 2003 .

[5]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[6]  Donald K. Friesen,et al.  Approximation for scheduling on uniform nonsimultaneous parallel machines , 2017, J. Sched..

[7]  George S. Lueker,et al.  Bin packing with items uniformly distributed over intervals [a,b] , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[8]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[9]  Zsolt Tuza,et al.  Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9 , 2013, Theor. Comput. Sci..

[10]  Keith W. Ross,et al.  The stochastic knapsack problem , 1989, IEEE Trans. Commun..

[11]  Rajkumar Buyya,et al.  CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms , 2011, Softw. Pract. Exp..

[12]  Guntram Scheithauer,et al.  The modified integer round-up property of the one-dimensional cutting stock problem , 1995 .

[13]  Pamela H. Vance,et al.  Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..

[14]  Manuel Iori,et al.  Bin packing and cutting stock problems: Mathematical models and exact algorithms , 2016, Eur. J. Oper. Res..

[15]  Deng Pan,et al.  Efficient VM placement with multiple deterministic and stochastic resources in data centers , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[16]  Gleb Belov,et al.  A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting , 2006, Eur. J. Oper. Res..

[17]  Guntram Scheithauer,et al.  Introduction to Cutting and Packing Optimization , 2018 .

[18]  José M. Valério de Carvalho,et al.  LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..

[19]  Waltenegus Dargie,et al.  A Stochastic Model for Estimating the Power Consumption of a Processor , 2015, IEEE Transactions on Computers.

[20]  L. V. Kantorovich,et al.  Mathematical Methods of Organizing and Planning Production , 1960 .

[21]  Alexander Schill,et al.  Power Consumption Estimation Models for Processors, Virtual Machines, and Servers , 2014, IEEE Transactions on Parallel and Distributed Systems.

[22]  José M. Valério de Carvalho,et al.  Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..

[23]  Yi Pan,et al.  Stochastic Load Balancing for Virtual Resource Management in Datacenters , 2020, IEEE Transactions on Cloud Computing.

[24]  H. Cramér.  Über eine Eigenschaft der normalen Verteilungsfunktion , 1936 .

[25]  Angelika Steger,et al.  Approximability of scheduling with fixed jobs , 1999, SODA '99.

[26]  Mohsen Guizani,et al.  Toward energy-efficient cloud computing: Prediction, consolidation, and overcommitment , 2015, IEEE Network.

[27]  Guido Perboli,et al.  The stochastic generalized bin packing problem , 2012, Discret. Appl. Math..

[28]  Jeffrey D. Ullman,et al.  L worst-case performance bounds for rumple one-dimensional packing algorithms siam j , 1974 .

[29]  Filipe Brandão.  VPSolver 3: Multiple-choice Vector Packing Solver , 2016, ArXiv.

[30]  Bennett Eisenberg,et al.  Why Is the Sum of Independent Normal Random Variables Normal? , 2008 .

[31]  João Pedro Pedroso,et al.  Bin packing and related problems: General arc-flow formulation with graph compression , 2013, Comput. Oper. Res..

[32]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[33]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[34]  Shin Gyu Kim,et al.  Virtual machine consolidation based on interference modeling , 2013, The Journal of Supercomputing.

[35]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[36]  Edward G. Coffman,et al.  Probabilistic analysis of packing and partitioning algorithms , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[37]  Rajkumar Buyya,et al.  Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in Cloud data centers , 2012, Concurr. Comput. Pract. Exp..

[38]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[39]  José M. Valério de Carvalho,et al.  A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems , 2018, Eur. J. Oper. Res..

[40]  Bu-Sung Lee,et al.  Optimization of Resource Provisioning Cost in Cloud Computing , 2012, IEEE Transactions on Services Computing.