Search Results

In this paper, we consider a bay design problem in a less-than-unit-load production warehouse, which is motivated by a real-world problem in a semiconductor company. The objective is to maximize the utilization of the vertical space in bays by ...

• A bay design problem for a less-than-unit-load warehouse is addressed and formulated as a mathematical programming model.
• A column-and-row generation (CRG) method is applied to the problem for the first time.
• The problem is ...

Online Bin Stretching is a problem closely related to Online Bin Packing and various scheduling problems. There is extensive history of computer search being used to establish lower bounds for this problem by identifying difficult sets of inputs. ...

This paper is concerned with a new variant of bin packing called priority-based bin packing with subset constraints (PBBP-SC). PBBP-SC is a variant of traditional bin packing (TBP). In a TBP instance, we are given a collection of items { t 1 , t ...

• Study of forwarder’s shipment planning problem considering shipment consolidation and containerization.
• Three-dimensional multiple bin size bin packing problem with heterogeneous irregular Unit Loading Devices.
• Mixed integer ...

This study focuses on an airfreight forwarder's shipment planning problem, while considering shipment consolidation and containerization in the international supply chain. Items belonging to different shipments from supplier's manufacturing ...

Cloud providers handle substantial number of requests to create and delete virtual machines (VMs) on a daily basis, where the unknown sequence of requests eventually leads to resource fragmentation. To mitigate this issue, periodic consolidation ...

Display Omitted

• We introduce the BalCon algorithm for solving the migration-aware consolidation
• The balance factor is proposed to measure free space distribution in a datacenter
• Force Fit is a key part of BalCon that allows for solving imbalanced ...

When industrial components are obtained by cutting bars of raw material (stocks), production volumes and values can be affected by random defects in the stocks. To deal with this inconvenience, we propose to design reconfigurable cutting patterns ...

• A new cutting stock problem based on a stochastic model of small defects is proposed.
• The theoretical properties of the resulting expected utilization of stock are studied.
• A subset sum based dynamic programming algorithm is ...

Dynamic virtual machine scheduling is a crucial research area in cloud computing, to optimize resource utilization, reduce energy consumption, and ensuring performance and availability by dynamically managing and scheduling virtual machines (VMs) across ...

The evolution of cloud computing results in the development of numerous huge data-centers. These data-centers use large quantities of electrical energy, which in turn results in high operating cost and high emissions of ${\text{CO}}_2$. The grounds for this ...

We consider a known variant of bin packing called cardinality constrained bin packing, also called bin packing with cardinality constraints (BPCC). In this problem, there is a parameter k ≥ 2, and items of rational sizes in [ 0 , 1 ] ...

Variable-Sized Bin Packing Problem with Time Windows (VSBPPTW) is a variant of the classical bin packing problem in which several types of bins with different sizes and costs are available, and the total cost of bins used to pack all ...

• We address the variable-sized bin packing problem with time windows.
• We propose ...

In the d-dimensional online bin packing problem, d-dimensional cubes of positive sizes no larger than 1 are presented one by one to be assigned to positions in d-dimensional unit cube bins. In this work, we provide improved upper bounds on the ...

This paper addresses the problem of scheduling chain-like structures of tasks on a single multiprocessor resource. In fact, sub-tasks of unit-time length and predefined size are aggregated to composite tasks that have to be scheduled without ...

We analyze a recently introduced concept, called the price of clustering, for variants of bin packing called open-end bin packing problems (OEBP). Input items have sizes, and they also belong to a certain number of types. The new ...

An online bin packing instance is a list of item sizes each of which is a rational number in ( 0 , 1 ], the goal is to partition the items into bins where the total size of items in a bin is at most 1, and the total number of bins is ...

Given the considerable complexity of process plants, there has been a great deal of research focused on aiding the design of plant layout through mathematical optimisation, i.e. optimising the positioning of the equipment in the plant ...

This paper focuses on the scheduling problem on two parallel machines with delivery coordination. In particular, given a set of n jobs, we aim to find a schedule with a minimal makespan such that all jobs are first executed on two parallel ...$\mathrm{}\mathrm{}$$\mathrm{}$$\mathrm{}\mathrm{}$

In this work, we study the well-known online bin packing problem and propose a new approximation algorithm under the restriction of linear time and constant bounded space. In this setting, Lee and Lee in 1985 [12] introduced an algorithm called ...${}_{}\mathrm{}$${}_{}$$\frac{\mathrm{}}{\mathrm{}}\mathrm{}$$\frac{\mathrm{}}{\mathrm{}}$$\frac{\mathrm{}}{\mathrm{}}\mathrm{}$$\frac{\mathrm{}}{\mathrm{}}$

Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logistics, and transportation science. In this paper, we introduce the reallocation problem that models the scheduling in which ...$$

Cloud computing has become one of the most popular frameworks for big data processing and analysis. To have better performance, the data chunks and their corresponding process nodes must be near each other, which is known as data locality. ...$\mathrm{}$

In this paper, we address the problem of constructing required subgraphs using stock pieces of fixed length (CRS-SPFL, for short), which is a new variant of the minimum-cost edge-weighted subgraph (MCEWS, for short) problem. Concretely, for the ...${}^{}$${}^{}$${}^{}$${}^{}$${}^{}$$$$\mathrm{}$$\mathrm{}$$\mathrm{}$$\frac{\mathrm{}}{\mathrm{}}$${}^{}$$\frac{\mathrm{}}{\mathrm{}}$${}^{}$$\frac{\mathrm{}}{\mathrm{}}$${}^{}$