Multi-objective temporal bin packing problem: an application in cloud computing

DOI10.1016/j.cor.2020.104959zbMath1458.90667OpenAlexW3023888684MaRDI QIDQ2664301

Ş. İlker Birbil, Nursen Aydin, Ịbrahim Muter

Publication date: 20 April 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/136154/1/WRAP-Multi-objective-temporal-bin-problem--cloud-computing.pdf

zbMATH Keywords

heuristicscolumn generationbin packingexact methodscloud computing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Internet topics (68M11)

Related Items

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, Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning, Lower and upper bounding procedures for the bin packing problem with concave loading cost, Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows, A combinatorial flow-based formulation for temporal bin packing problems, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups, Interval scheduling with economies of scale

Cites Work

• Unnamed Item
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• A multi-objective ant colony system algorithm for virtual machine placement in cloud computing
• The pickup and delivery problem with time windows
• A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines
• LP models for bin packing and cutting stock problems
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
• Decomposition Principle for Linear Programs
• The Vehicle Scheduling Problem with Multiple Vehicle Types
• Tabu Search—Part I
• Shortest Path Problems with Resource Constraints
• Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation