Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)
RetourCahiers du GERAD
806 résultats — page 11 de 41
La création d’horaires de personnel aériens est généralement effectuée en deux étapes : la création de rotations d’équipage, suivie par la création d’horaire...
référence BibTeXA 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 ...
référence BibTeX
L'indice géométrique-arithmétique \(GA\) d'un graphe \(G\) est la somme des ratios, sur l'ensemble des arêtes de \(G\), de la moyenne géométrique sur l...
Dans le présent article, nous comparons l'indice géométrique-arithmétique \(GA\) et le nombre chromatique \(\chi\) d'un graphe connexe d'ordre donné. Ent...
The technological developments observed in the last two decades contributed to the digitalization of products and the introduction of devices to consume th...
référence BibTeX
In this paper, we introduce a general framework for vector space decompositions that decompose the set partitioning problem into a reduced problem, defined...
référence BibTeX
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...
référence BibTeX
Inventory routing problems aim at minimizing the cost of the total distance traveled over a time horizon discretized in periods, while guaranteeing that th...
référence BibTeX
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...
référence BibTeX
Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
In this paper we present a novel formulation based on a certain median function to solve discretely constrained mixed complementarity problems (MCPs). Such p...
référence BibTeX
Starting from the improved primal simplex (IPS) decomposition, introduced by Elhallaoui et al. (2011) to tackle degeneracy in general linear programs, we int...
référence BibTeX
Non-price attributes such as prior relationship, product quality, and reliability can be more important than bidding prices for the buyers when selecting the...
référence BibTeX
Cet article traite du problème de gestion de projet avec contraintes de ressources qui consiste à ordonnancer des activités de façon à minimiser le temps de ...
référence BibTeX
This paper addresses the optimization of mineral supply chain operations under metal and material type uncertainties. A mathematical model to simultaneously ...
référence BibTeXMultilevel 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...
référence BibTeX
Dans cet article, nous étudions des stratégies pour résoudre le problème de partitionnement d'ensemble (PPE), en particulier les gains en efficacité qui pe...
référence BibTeX