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

Retour

Cahiers du GERAD

806 résultats — page 37 de 41

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

This paper considers a flexible manufacturing system for several products, each requiring a number of sequential non-preemptive tasks, some of which may be...

référence BibTeX
et

The development of truck dispatching systems has during recent years taken two directions. One has been systems using mathematical optimization and powerfu...

référence BibTeX
, , et

Because of the transmission of disease producing parasites to man and animals and the nuisance caused by bites from adult black flies, they are the object o...

référence BibTeX
, et

This paper presents a model for the optimization of productivity in a steel plant comprised of four arc furnaces and three continuous casting machines and su...

référence BibTeX
, et

The vehicle routing problem (VRP) involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a fleet of vehicl...

référence BibTeX
, , et

The two-dimensional cutting-stock problem consists of laying out a specified list of rectangular pieces on rectangular sheets, in such a way as to minimize t...

référence BibTeX

The vehicle routing problem (VRP) involves the design of a set of minimum cost routes for a fleet of vehicles which services exactly once a set of customers...

référence BibTeX