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

DOI10.1007/S10288-018-0384-4MaRDI QIDQ2001201zbMATH OpenOpenAlexWikidataFDO

Authors J. Martinovic, Markus Hähnel, Guntram Scheithauer, Waltenegus Dargie, Andreas Fischer

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

cutting and packingHAECinteger programmingnondeterministic item lengthsnormal distributionserver consolidation

Mathematics Subject Classification ID

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

Recommendations

• Mathematical models and approximate solution approaches for the stochastic bin packing problem
• The stochastic trim-loss problem
• The generalized assortment and best cutting stock length problems
• On the cutting stock problem under stochastic demand
• The cutting stock problem

Cites work

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

Cited in

(8)

• Grids for cutting and packing problems: a study in the 2D knapsack problem
• An introduction to stochastic bin packing-based server consolidation with conflicts
• Using matrix approximation for high-dimensional discrete optimization problems: server consolidation based on cyclic time-series data
• A branch-and-price algorithm for the temporal bin packing problem
• 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
• The generalized assortment and best cutting stock length problems
• A heuristic column generation approach for the stochastic bin packing problem

Describes a project that uses

Uses Software

• CloudSim

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2001201)