Smart logistics (schedule design, supply chains, logistics, manufacturing systems)

Back

Cahiers du GERAD

729 results — page 28 of 37

Rotating schedules are commonly used in a number of industries and public services where employees work round the clock, seven days a week. Several rules g...

BibTeX reference
, , , and

An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from Euclidean <i>m</i>-s...

BibTeX reference

The problem of assigning locomotives and cars to trains is a complex task for most railways. In this paper, we propose a multi-commodity network flow based ...

BibTeX reference
, , and

Given a graph <i>G</i> with <i>n</i> vertices and stability number <img src="alpha.gif" align=bottom>(<i>G</i>), Turán's theorem gives a lower bound on the ...

BibTeX reference

An important aspect of railway planning concerns the distribution of locomotives and cars in the network and their assignment to the scheduled trains. In th...

BibTeX reference
, , and

Dans le cadre du projet de recherche franco-québécois "COPRAIC": COnception et PRoduction Accélérées dans un contexte d'Ingénierie Concourante, une enquête ...

BibTeX reference
, , and

This paper considers the placement of components onto printed circuit boards (PCB's) using surface mount technology. Multiple automatic placement machines, ...

BibTeX reference
, , , , and

Cet article décrit un problème d'horaires mensuels personnalisés pour les membres d'équipage (pilotes et officiers) en transport aérien. Ce problème consist...

BibTeX reference
, , and

Dans le cadre du projet de recherche franco-québécois "COPRAIC": COnception et PRoduction Accélérées dans un contexte de l'Ingénierie Concourante, une enquê...

BibTeX reference
, , and

We consider Nash equilibria as correlated equilibria and apply polyhedral theory to study extreme Nash equilibrium properties. We obtain an alternate proof ...

BibTeX reference
and

This paper considers the shortest path problem with waiting costs (SPWC) as an extension of the shortest path problem with time windows. The problem consis...

BibTeX reference

In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem. These incl...

BibTeX reference

One of the many problems faced by rail transportation companies is to optimize the utilization of the available stock of locomotives and cars. In this paper...

BibTeX reference
, , and

The aim of this paper is to present a survey of recent optimization models for the most commonly studied rail transportation problems. For each group of pro...

BibTeX reference
, , , and

Column generation is often used to solve large scale optimization problems, and much research has been devoted to improve the convergence of the solution pr...

BibTeX reference
, , and

The paper deals with a problem of determining optimal advertising expenditures in a two-member channel of distribution in which the manufacturer invests in ...

BibTeX reference

A new algorithm, which exploits information from both ends of the network, is presented for the bicriterion shortest path problem. The algorithm extends eff...

BibTeX reference
, , and

Cet article identifie pour chaque fonction logistique les décisions à prendre et propose une séquence organisée de façon à constituer un processus décisionn...

BibTeX reference
, , and

A new algorithm, based on interval analysis, is proposed for global optimization of constrained nonlinear nonconvex functions of several variables. It expl...

BibTeX reference
and

This study investigates a new phenomenon of degeneracy in the multi-source Weber problem. This phenomenon relates to the existence of solutions in which one...

BibTeX reference