Axis 2: Decision support made in complex systems

Back

Cahiers du GERAD

1368 results — page 63 of 69

and

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...

BibTeX reference
, , , and

It is well known that several combinatorial optimization problems can be nicely and readily modeled as an appropriate quadratic 0-1 function to be optimized...

BibTeX reference
, , and

In the Dual Bin Packing Problem (DBP), there are an unlimited number of bins of identical capacity, and unsplittable items of given weights. The aim is to ...

BibTeX reference

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

BibTeX reference

We consider the problem of defining a fair sharing of the total advantages gained by two regions (players) which decide to coordinate their environmental po...

BibTeX reference

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. ...

BibTeX reference
, , and

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...

BibTeX reference
, , and

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...

BibTeX reference
, , and

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

BibTeX reference
and

We consider a price setting duopoly producing differentiated goods, where the players can learn by doing and from each other. The unit production cost is mo...

BibTeX reference

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...

BibTeX reference

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...

BibTeX reference

This paper deals with the modeling of economy-environment interactions for several countries which are assumed to behave competitively for the control of th...

BibTeX reference
, , , and

The stochastic linear programming problem with recourse has a dual block angular structure. It can thus be handled by Benders decomposition or by Kelley's m...

BibTeX reference
, , , and

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

BibTeX reference

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

BibTeX reference
, , and

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...

BibTeX reference

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 ...

BibTeX reference
, , and

We present a method for designing spine layouts. A spine layout is a layout in which a main aisle is used for the movements between the work cells located o...

BibTeX reference

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

BibTeX reference