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

DOI10.1007/S10288-018-0384-4zbMath1415.90064OpenAlexW2883279796WikidataQ129494472 ScholiaQ129494472MaRDI QIDQ2001201

Andreas Fischer, Guntram Scheithauer, John Martinovic, Waltenegus Dargie, Markus Hähnel

Publication date: 2 July 2019

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-018-0384-4

zbMATH Keywords

integer programmingnormal distributioncutting and packingHAECnondeterministic item lengthsserver consolidation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Stochastic scheduling theory in operations research (90B36) Mathematical problems of computer architecture (68M07)

Related Items (6)

An introduction to stochastic bin packing-based server consolidation with conflicts ⋮ Compact integer linear programming formulations for the temporal bin packing problem with fire-ups ⋮ Mathematical models and approximate solution approaches for the stochastic bin packing problem ⋮ Grids for cutting and packing problems: a study in the 2D knapsack problem ⋮ A heuristic column generation approach for the stochastic bin packing problem ⋮ A branch-and-price algorithm for the temporal bin packing problem

Uses Software

• CloudSim

Cites Work

• Unnamed Item
• Unnamed Item
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Bin packing and related problems: general arc-flow formulation with graph compression
• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
• The stochastic generalized bin packing problem
• The modified integer round-up property of the one-dimensional cutting stock problem
• Exact solution of bin-packing problems using column generation and branch-and-bound
• Solving binary cutting stock problems by column generation and branch- and-bound
• Branch-and-price algorithms for the one-dimensional cutting stock problem
• Approximation for scheduling on uniform nonsimultaneous parallel machines
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
• LP models for bin packing and cutting stock problems
• Approximability of scheduling with fixed jobs
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• Mathematical Methods of Organizing and Planning Production
• A Stochastic Model for Estimating the Power Consumption of a Processor
• A Linear Programming Approach to the Cutting-Stock Problem
• Why Is the Sum of Independent Normal Random Variables Normal?
• The stochastic knapsack problem
• A New Linear Programming Approach to the Cutting Stock Problem
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• An Application of Bin-Packing to Multiprocessor Scheduling
• A Primer on Statistical Distributions

This page was built for publication: Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation