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

Retour

Cahiers du GERAD

773 résultats — page 35 de 39

, et

In operations planning in an open pit mine an economic blocks model is generally used which attempts to determine which blocks will be extracted during each...

référence BibTeX
, et

Given a binary matrix <i>E</i>, the Seriation Problem consists of determining a permutation of the rows of <i>E</i> minimizing the sum over all columns of t...

référence BibTeX
, et

The majority of the examination timetabling software programs available today suffer from one of the following drawbacks: either the techniques are not very...

référence BibTeX

We consider the problem of finding a shortest path for a car-like robot maneuvering in a convex cell. This robot, capable of forward and backward motion, is...

référence BibTeX

We study the problem of finding a shortest path for a car-like mobile robot with a minimal turning radius constraint. This vehicle can move either forward o...

référence BibTeX
, , et

This paper presents the development of a new optimal dynamic programming algorithm for the minimization of the total traveling cost for the traveling salesm...

référence BibTeX
, et

The NP-hard problem addressed in this paper is well known in the scheduling literature as <i>R</i>|<i>C</i><sub><font size=-1>max</font></sub>. We introduce...

référence BibTeX

The problem of finding a minimal length trajectory (MLT) for a mobile robot has changed in the last five years, as vehicle kinematics have come to be taken ...

référence BibTeX

In this paper, optimal strip strategies are developed for a variety of two-dimensional and three-dimensional sequencing problems arising in flexible manufac...

référence BibTeX
, , , et

We present a new two-commodity flow formulation for the traveling salesman problem. Each commodity corresponds to a resource that is either distributed or p...

référence BibTeX

In this paper, the expected distance between two uniformly distributed random points in a rectangle or in a rectangular parallelepiped is computed under thr...

référence BibTeX
, et

Examination scheduling is a problem in virtually every high school, college and university. The basic challenge is to schedule examinations over a limited ...

référence BibTeX
, et

The purpose of this paper is to describe a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algori...

référence BibTeX

The Airline Crew Scheduling Problem can be defined as the problem of finding a set of feasible rotations so that the total cost is minimum and all the fligh...

référence BibTeX
et

This paper describes a domain criterion for a multicriteria problem, given a single decision maker. It then outlines possibilities for aggregating individua...

référence BibTeX

We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process ...

référence BibTeX
, , , et

In many cities around the world, public transportation services are requested to provide adapted transportation for handicapped persons and people with rest...

référence BibTeX
et

We consider a generalization of PERT where task durations are variable and the cost of each task is a convex function of its duration. Moreover, each preced...

référence BibTeX
, et

The vehicle routing problem with time windows (VRPTW) is a generalization of the vehicle routing problem where the service of a customer can begin within th...

référence BibTeX
et

In this paper, the problem of optimally locating the numbers around a dart board is investigated. The objective considered is risk maximization. Under diffe...

référence BibTeX