Related papers: A branch and price procedure for the container pre…
In warehouse and manufacturing environments, manipulation platforms are frequently deployed at conveyor belts to perform pick and place tasks. Because objects on the conveyor belts are moving, robots have limited time to pick them up. This…
Recent studies in maritime logistics have introduced a general ship routing problem and a benchmark suite based on real shipping segments, considering pickups and deliveries, cargo selection, ship-dependent starting locations, travel times…
With the growing demand for openness, scalability, and granularity, mobile network function virtualization (NFV) has emerged as a key enabler for most mobile network operators. NFV decouples network functions from hardware devices. This…
Location Routing is a fundamental planning problem in logistics, in which strategic location decisions on the placement of facilities (depots, distribution centers, warehouses etc.) are taken based on accurate estimates of operational…
We consider here the MultiBot problem for the scheduling and the resource parametrization of jobs related to the production or the transportation of different products inside a given time horizon. Those jobs must meet known in advance…
Hub Covering Problems arise in various practical domains, such as urban planning, cargo delivery systems, airline networks, telecommunication network design, and e-mobility. The task is to select a set of hubs that enable tours between…
We study the computational complexity of scheduling jobs on a single speed-scalable processor with the objective of capturing the trade-off between the (weighted) flow time and the energy consumption. This trade-off has been extensively…
The order picker routing problem involves finding the optimal tour of a warehouse that collects all the required items on a given pick list. Ratliff and Rosenthal introduced a dynamic programming algorithm for solving this problem in…
Prehensile object rearrangement in cluttered and confined spaces has broad applications but is also challenging. For instance, rearranging products in a grocery shelf means that the robot cannot directly access all objects and has limited…
Packing and vehicle routing problems play an important role in the area of supply chain management. In this paper, we introduce a non-linear knapsack problem that occurs when packing items along a fixed route and taking into account travel…
Various operational optimization problems arise in cross-dock synchronization. The combination of the truck scheduling with other decision problems in cross-docking has been targeted by researchers in the recent years. In most of the truck…
In the online simple knapsack problem items are presented in an iterative fashion and an algorithm has to decide for each item whether to reject or permanently include it into the knapsack without any knowledge about the rest of the…
We consider the model of a transportation problem with the objective of finding a minimum-cost transportation plan for shipping a given commodity from a set of supply centers to the customers. Since the exact values of supply and demand and…
We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clusters. This problem is known as the clique partitioning…
We study the computational complexity of one of the particular cases of the knapsack problem: the subset sum problem. For solving this problem we consider one of the basic variants of the Branch-and-Bound method in which any sub-problem is…
In this paper, we consider an NP-hard problem of scheduling a set of jobs of equal processing time on two machines, given a partial precedence order on the set of jobs, with an objective to minimize the makespan. An approximation algorithm…
The crew rostering problem (CRP) for pilots is a complex crew scheduling task assigning pairings, or sequences of flights starting and ending at the same airport, to pilots to create a monthly schedule. In this paper, we propose an…
The online knapsack problem is a classic online resource allocation problem in networking and operations research. Its basic version studies how to pack online arriving items of different sizes and values into a capacity-limited knapsack.…
In this paper, we address a variant of a batch scheduling problem with identical parallel machines and non-anticipatory family setup times to minimize the total weighted completion time. We developed an ILS and a GRASP matheuristics to…
Internet traffic continues to grow exponentially, calling for switches that can scale well in both size and speed. While load-balanced switches can achieve such scalability, they suffer from a fundamental packet reordering problem. Existing…