François Soumis

Retour

Cahiers du GERAD

170 résultats — page 7 de 9

, et

The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems su...

référence BibTeX
, , , et

There are several routing and scheduling problems faced by airline companies, notably, aircraft scheduling, pairing generation and crew bidding and rosterin...

référence BibTeX
, , et

This survey paper describes the significant advances made in time constrained vehicle routing and crew scheduling problems. In terms of solution methodolog...

référence BibTeX
, , et

This paper describes strip sequencing models for large scale traveling salesman problems arising in flexible manufacturing operations in two or three discre...

référence BibTeX
et

In this paper we analyze the efficiency of a given robot movement schedule for the case of a flowshop robotic production cell with <i>m</i> different machin...

référence BibTeX
et

This paper propose a column generation method for optimally solving the rostering problem. Various strategies for accelerating the column generation process...

référence BibTeX
, et

The purpose of this paper is to formulate and solve an optimization problem arising in the operations of a numerical control machine such as a punch press. ...

référence BibTeX
, 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

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
et

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

One important issue being addressed in the design of Distributed Computer Networks is how to increase the availability of time-changing information even in ...

référence BibTeX
et

We give a new formulation to the multiple-depot vehicle scheduling problem as a set partitioning problem with side constraints, whose continuous relaxation ...

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
et

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
, et

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
, et

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

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

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