Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
729 results — page 4 of 37
Personnel scheduling consists of determining least-cost work schedules to cover the demand of multiple jobs expressed in number of employees per job and peri...
BibTeX referenceVariable fixing for two-arc sequences in branch-price-and-cut algorithms on path-based models
Variable fixing by reduced costs is a popular technique for accelerating the solution process of mixed-integer linear programs. For vehicle routing problems ...
BibTeX reference
User-centered logistics aiming at customer satisfaction are gaining importance due to growing e-commerce and home deliveries. Customer satisfaction can be ...
BibTeX reference
This paper studies the Dynamic Facility Location Problem with Modular Capacities (DFLPM). We propose a linear relaxation based heuristic (LRH) and an evoluti...
BibTeX reference
In large commercial airlines, the monthly schedule (roster) of the crew members is usually determined by solving two problems sequentially, namely, the crew ...
BibTeX reference
We present a case study of using machine learning classification algorithms to initialize a large scale commercial operations research solver (GENCOL) in the...
BibTeX reference
In the Inventory Routing Problem customer demand is satisfied from inventory which is replenished with capacitated vehicles. The objective is to minimize tot...
BibTeX reference
Given a set of duties to be operated over a cyclic one-week horizon and groups of drivers with similar characteristics, the cyclic bus driver rostering probl...
BibTeX reference
We consider a personalized employee scheduling problem with characteristics present in retail stores consisting of multiple departments. In the setting under...
BibTeX reference
This paper develops an exact method for the redundancy allocation problem (RAP) for multistate homogeneous series-parallel systems. The problem aims to min...
BibTeX referenceDistributed integral column generation
The Integral Simplex Using Decomposition (ISUD) algorithm has been developed recently to solve large set partitioning problems (SPPs) in a primal way, i.e.,...
BibTeX reference
Facility networks can be disrupted by, for example, power outages, poor weather conditions, or natural disasters, and the probabilities of these events may b...
BibTeX reference
In this paper, we develop algorithmic approaches for a recently defined class of games, the integer programming games. Two general methods to approximate an...
BibTeX reference
In this paper, we study the problem of responsibility sharing for product recovery, and its relation to the design of Extended Producer Responsibility (EPR) ...
BibTeX reference
We study an integrated process configuration, lot-sizing, and scheduling problem, which appears in a real production environment in the packaging industry. P...
BibTeX referenceA PCA-based approximation scheme for combinatorial optimization with uncertain and correlated data
This paper addresses combinatorial optimization problems under uncertain and correlated data where the mean-covariance information of the random data is assu...
BibTeX reference
We address a three-level lot sizing and replenishment problem with a distribution structure (3LSPD), which is an extension of the one-warehouse multi-retaile...
BibTeX reference
We consider an integrated planning problem that combines production, inventory and inbound transportation decisions in a context where several suppliers each...
BibTeX reference
The Time Window Assignment Vehicle Routing Problem (TWAVRP) is the problem of assigning time windows for delivery before demand volume becomes known. This i...
BibTeX reference
Personnel scheduling aims at determining the cheapest work schedules to cover the demand for one or more tasks at each period of a given horizon. During the ...
BibTeX reference