Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)
RetourCahiers du GERAD
801 résultats — page 13 de 41
Nous considérons une chaîne d'approvisionnement fermée composée d'un fabricant et d'un détaillant dans un contexte dynamique. Les joueurs investissent dans ...
référence BibTeXShift scheduling under stochastic demand
Shift scheduling when the demand for employees is stochastic is usually done in two steps. Since employees need to know their shifts before the demand is kno...
référence BibTeX
This paper focuses on the resolution of the capacitated minimum cost flow problem on a network comprising <i>n</i> nodes and <i>m</i> arcs. We present a met...
référence BibTeX
We present a matheuristic, an integer programming based heuristic, for the liner shipping network design problem. This problem consists of finding a set of...
référence BibTeX
The inventory-routing problem (IRP) integrates two well-studied problems, namely, inventory management and vehicle routing. Given a set of customers to servi...
référence BibTeX
The dust suppression of hauling roads in open-pit mines is done by periodically spraying water from a water truck. The objective of this article is to presen...
référence BibTeX
Finding communities in complex networks is a topic of much current research and has applications in many domains. On the one hand, criteria for doing so hav...
référence BibTeX
This paper presents the first direct implementation of the positive edge criterion using COIN-OR's CLP, where it has been combined with the Devex pivot rule....
référence BibTeX
In this paper, we suggest a new approach called the <i>return function</i> to deal with the determination of Bayesian-Nash equilibria in games of incomplet...
référence BibTeX
The <b>VRPTW-ST</b> introduced by Errico et al. (2013) in the form of a chance-constrained model mainly differs from other vehicle routing problems with st...
référence BibTeX
This article describes the problem in which the edges of a network represent customers, and a quantity of material is delivered to them so that each one achi...
référence BibTeXBuffer Dimensioning and Control Stations Positioning with a Space Partitioning-Tabu Search Approach
We propose an efficient heuristic method based on Space Partitioning (SP) and Tabu Search (TS) to solve the buffer sizing problem in unreliable production li...
référence BibTeXAn Exact Method for Solving the Buffer Sizing and Inspection Stations Allocations Problem
An unreliable single part type transfer line with fixed inter machine buffer sizes is considered. In general, imperfect machines operating with imperfect raw...
référence BibTeX
The analysis of networks and in particular the identification of communities, or clusters, is a topic of active research with application arising in many dom...
référence BibTeX
Since its inception, stochastic Data Envelopment Analysis (DEA) has found many applications. The approach commonly taken in stochastic DEA is via chance cons...
référence BibTeX
Aircraft maintenance planning is of critical importance to the safe and efficient operations of an airline. It is common to solve the aircraft routing and ma...
référence BibTeXDistance Spectra of Graphs: A Survey
In 1971, Graham and Pollack established a relationship between the number of negative eigenvalues of the distance matrix and the addressing problem in data c...
référence BibTeXChromatic Scheduling
Variations and extensions of the basic vertex-colouring and edge-colouring models have been developed to deal with increasingly complex scheduling problems. ...
référence BibTeX
We study the Capacity Constrained Lot Size Problem with Setup Times (CLST). Based on two strong reformulations of the problem, we present a transformed refor...
référence BibTeX
In this article we introduce the Quadratic Capacitated Vehicle Routing Problem (QCVRP), a combinatorial optimization problem that arises in practical applica...
référence BibTeX