Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
type: Item
instance of: scholarly article
title: Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
zbMATH Open document ID: 1415.90064
author: J. Martinovic
author: Markus Hähnel
author: Guntram Scheithauer
author: Waltenegus Dargie
author: Andreas Fischer
published in: 4OR
publication date: 2019-07-02T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 68M07
zbMATH DE Number: 7075666
zbMATH Keywords: cutting and packing
zbMATH Keywords: server consolidation
zbMATH Keywords: normal distribution
zbMATH Keywords: nondeterministic item lengths
zbMATH Keywords: integer programming
zbMATH Keywords: HAEC
describes a project that uses: CloudSim
MaRDI profile type: Publication
full work available at URL: s10288-018-0384-4
OpenAlex ID: W2883279796
cites work: Q3160276
cites work: A Primer on Statistical Distributions
cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
cites work: Bin packing and related problems: general arc-flow formulation with graph compression
cites work: Q4002885
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
cites work: A Stochastic Model for Estimating the Power Consumption of a Processor
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: LP models for bin packing and cutting stock problems
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
cites work: A New Linear Programming Approach to the Cutting Stock Problem
cites work: Why Is the Sum of Independent Normal Random Variables Normal?
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Approximation for scheduling on uniform nonsimultaneous parallel machines
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
cites work: The stochastic generalized bin packing problem
cites work: The stochastic knapsack problem
cites work: Approximability of scheduling with fixed jobs
cites work: Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
cites work: The modified integer round-up property of the one-dimensional cutting stock problem
cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem
cites work: Solving binary cutting stock problems by column generation and branch- and-bound
Wikidata QID: Q129494472
DOI: 10.1007/S10288-018-0384-4
description: scientific article; zbMATH DE number 7075666