Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
806 results — page 11 of 41
Airline crew scheduling is typically performed in two steps : crew pairing followed by crew assignment. The crew pairing problem (CPP) finds a set of pairing...
BibTeX referenceA Branch-Price-and-Cut algorithm for a production-routing problem with short-lifespan products
We study a rich production-routing problem with time windows arising at a catering services company. The production part consists of assembling the meals to ...
BibTeX reference
The geometric-arithmetic index \(GA\) of a graph \(G\) is the sum of ratios, over all edges of \(G\), of the geometric mean to the arithmetic mean of t...
In the present paper, we compare the geometric-arithmetic index \(GA\) and the chromatic number \(\chi\) of a connected graph with given order. We prove,...
The technological developments observed in the last two decades contributed to the digitalization of products and the introduction of devices to consume th...
BibTeX reference
In this paper, we introduce a general framework for vector space decompositions that decompose the set partitioning problem into a reduced problem, defined...
BibTeX reference
The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited...
BibTeX reference
Inventory routing problems aim at minimizing the cost of the total distance traveled over a time horizon discretized in periods, while guaranteeing that th...
BibTeX reference
This paper introduces the pickup and delivery problem with time windows and handling operations. In this problem, the loading compartment of a vehicle is mod...
BibTeX reference
Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a...
BibTeX reference
Given a flight schedule and a set of aircraft of different types, the airline fleet assignment problem (FAP) consists of assigning an aircraft type to each f...
BibTeX reference
We model and solve the problem of sequencing a set of jobs with specified processing times and tool requirements on a set of identical parallel machines. D...
BibTeX reference
The tail assignment problem is a critical part of the airline planning process that assigns specific aircraft to sequences of flights, called lines-of-flight...
BibTeX reference
In this paper we present a novel formulation based on a certain median function to solve discretely constrained mixed complementarity problems (MCPs). Such p...
BibTeX reference
Starting from the improved primal simplex (IPS) decomposition, introduced by Elhallaoui et al. (2011) to tackle degeneracy in general linear programs, we int...
BibTeX reference
Non-price attributes such as prior relationship, product quality, and reliability can be more important than bidding prices for the buyers when selecting the...
BibTeX reference
This paper deals with the resource constrained project scheduling problem, which consists of scheduling a set of activities with minimal duration that are su...
BibTeX reference
This paper addresses the optimization of mineral supply chain operations under metal and material type uncertainties. A mathematical model to simultaneously ...
BibTeX referenceMultilevel hybrid method for solving buffer sizing and inspection stations allocation problems
This paper develops an efficient method to solve a typical combinatorial optimization problem that is frequently encountered when designing high levels of pr...
BibTeX reference
In this article we investigate some strategies for solving set partitioning problems (SPP), in particular the gains in computational efficiency that can be...
BibTeX reference