On-line three-dimensional packing problems: A review of off-line and on-line solution approaches
Abstract Three-Dimensional Packing Problems (3D-PPs) can be applied to effectively
reduce logistics costs in various areas, such as airline cargo management and warehouse …
reduce logistics costs in various areas, such as airline cargo management and warehouse …
[BOOK][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
A new model for Last-Mile Delivery and Satellite Depots management: The impact of the on-demand economy
Two-tier city logistics systems are playing a very important role nowadays in the
management of urban freight activities. Although several city authorities have promoted …
management of urban freight activities. Although several city authorities have promoted …
Cost-effective app user allocation in an edge computing environment
Edge computing is a new distributed computing paradigm extending the cloud computing
paradigm, offering much lower end-to-end latency, as real-time, latency-sensitive …
paradigm, offering much lower end-to-end latency, as real-time, latency-sensitive …
Comparing vm-placement algorithms for on-demand clouds
K Mills, J Filliben, C Dabrowski - 2011 IEEE Third International …, 2011 - ieeexplore.ieee.org
Much recent research has been devoted to investigating algorithms for allocating virtual
machines (VMs) to physical machines (PMs) in infrastructure clouds. Many such algorithms …
machines (VMs) to physical machines (PMs) in infrastructure clouds. Many such algorithms …
Efficient lower bounds and heuristics for the variable cost and size bin packing problem
We consider the variable cost and size bin packing problem, a generalization of the well-
known bin packing problem, where a set of items must be packed into a set of …
known bin packing problem, where a set of items must be packed into a set of …
New lower bounds for certain classes of bin packing algorithms
On-line algorithms have been extensively studied for the one-dimensional bin packing
problem. In this paper, we investigate two classes of one-dimensional bin packing …
problem. In this paper, we investigate two classes of one-dimensional bin packing …
Grammatical evolution of local search heuristics
Genetic programming approaches have been employed in the literature to automatically
design constructive heuristics for cutting and packing problems. These heuristics obtain …
design constructive heuristics for cutting and packing problems. These heuristics obtain …
Automating the packing heuristic design process with genetic programming
The literature shows that one-, two-, and three-dimensional bin packing and knapsack
packing are difficult problems in operational research. Many techniques, including exact …
packing are difficult problems in operational research. Many techniques, including exact …
Improving operating room schedules
F Li, D Gupta, S Potthoff - Health care management science, 2016 - Springer
Operating rooms (ORs) in US hospitals are costly to staff, generate about 70% of a hospital's
revenues, and operate at a staffed-capacity utilization of 60-70%. Many hospitals allocate …
revenues, and operate at a staffed-capacity utilization of 60-70%. Many hospitals allocate …