Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)

Retour

Cahiers du GERAD

801 résultats — page 23 de 41

, et

We consider two (0,1)-linear programming formulations of the graph (vertex-) coloring problem, in which variables are associated to stable sets of the input...

référence BibTeX
et

Ce document valide le cadre conceptuel de logistique inverse de Lambert et Riopel (2004) à l'aide de trois cas industriels d'entreprises oeuvrant dans diffé...

référence BibTeX
, et

This paper presents a general mixed-norm minisum problem for locating a single facility in continuous space. It is assumed that several transportation modes...

référence BibTeX
, et

The Team Orienteering Problem (TOP) is the generalization to the case of mul- tiple tours of the Orienteering Problem, known also as Selective Traveling Sal...

référence BibTeX
, , , et

Earth observation satellites are platforms equipped with optical instruments that orbit the Earth in order to take photographs of specific areas at the requ...

référence BibTeX

Given the sets of flights and aircraft of an airline carrier, the fleet assignment problem consists of assigning the most profitable aircraft type to each f...

référence BibTeX

The paper examines shelf-space allocation and pricing decisions in the marketing channel as the results of a static game played à la Stackelberg between two...

référence BibTeX
, et

We consider a crew scheduling problem with preferential bidding in the airline industry. We propose a new methodology based on a graph coloring model and a ...

référence BibTeX
, , et

Column generation has proven to be efficient in solving the linear programming relaxation of large scale instances of the Multiple-Depot Vehicle Scheduling ...

référence BibTeX

Given the flight schedule of an airline, the fleet assignment problem consists of determining the aircraft type to assign to each flight leg in order to max...

référence BibTeX
, , et

The variable neighborhood search metaheuristic is applied to the primal simple plant location problem and to a reduced dual obtained by exploiting the compl...

référence BibTeX
et

An infinite-horizon differential game between a manufacturer and a retailer is con- sidered. The players control their marketing efforts and the sales share...

référence BibTeX
, et

In this paper, a solution approach based on the column generation technique is pre- sented for solving a time-indexed formulation of the total weighted tard...

référence BibTeX

We consider vehicle routing and crew scheduling problems that involve a lexico- graphic bi-level objective function (for instance, minimizing first the numb...

référence BibTeX
, , , et

This paper examines the plant location problem under the objective of maximizing return-on-investment. However, in place of the standard assumption that all...

référence BibTeX
, et

Column generation is one of the most successful approaches for solving large scale linear programming problems. However, degeneracy difficulties and long-ta...

référence BibTeX

Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues ...

référence BibTeX
, et

Several upper bounds on the largest Laplacian eigenvalue of a graph <i>G</i>, in terms of degree and average degree of neighbors of its vertices, have been ...

référence BibTeX

This paper considers a shift scheduling problem that includes different forms of flexibility in terms of shift starting times, break lengths and break plac...

référence BibTeX
, , et

Une étude du transport de roses coupées, en collaboration avec la plantation Mira- flores évalue l’exportation de Bogotá (Colombie) vers Miami (USA), port d...

référence BibTeX