Cahiers du GERAD
Search
Chronological list
3159 results — page 149 of 158
In this paper, we present general formulations for the stochastic vehicle routing problem with capacity restrictions in which the <i>m</i> vehicle tours hav...
BibTeX reference
Given a weighted graph with profits associated with the vertices, the selective travelling salesman problem (or orienteering problem) consists of selecting ...
BibTeX reference
This paper presents a linear programming model of the Quebec and New York State power systems which includes a detailed description of the different types o...
BibTeX reference
Consider the optimal control problem for the two processor flow-shop when processing times for <i>n</i> tasks are (linear) functions of the state. Since th...
BibTeX reference
In this paper a study on Second and Third degree Stochastic Dominances for the family of concave and convex utility functions is proposed. This is the LDEU...
BibTeX reference
La programmation mathématique à plusieurs niveaux permet de modéliser adéquatement certaines structures de décision hiérarchisées. Cette thèse contribue au ...
BibTeX reference
In this paper, we deal with the problem of scheduling parts and robot moves in a roboic cell where the robot is used to feed machines in the cell. The robo...
BibTeX reference
Consider <i>N</i> entities to be classified, and a matrix of dissimilarities between pairs of them. The split of a cluster is the smallest dissimilarity be...
BibTeX referenceLa modélisation analytique du transport porte-à-porte et ses applications au transport adapté
This report proposes some approximate analytical models allowing the evaluation of the average service time for a user of a door-to-door transportation syst...
BibTeX reference
This research review presents very recent results in the theory of deterministic scheduling in production systems. The deterministic models dealt with inclu...
BibTeX reference
The object of this study is to solve a resource sharing problem. One considers a surgery ward with a fixed number of beds. A team of surgeons is sharing th...
BibTeX reference
We study the design problem of part-orienting systems which are often employed in many manufacturing environments to orient parts of assembly or to perform o...
BibTeX reference
We study here the classification problem for a particular class of moduloïds over a dioïd, called simple pseudomodules. After introducing the concept of can...
BibTeX reference
We study the performance of scheduling algorithms for a manufacturing system, called the "No-wait Flowshop", which consists of a certain number of machine ce...
BibTeX reference
The Basic Algorithm of pseudo-Boolean programming due to Hammer and Rudeanu allows to minimize nonlinear 0-1 functions by recursively eliminating one variabl...
BibTeX reference
We propose a classification scheme for a class of models that arise in the area of vehicle routing and scheduling and illustrate it on a number of problems t...
BibTeX referenceMinimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables
We present a dual algorithm to minimize a separable convex function under ratio constraints between variables. This minimization problem occurs when the dep...
BibTeX referenceAlgorithms for Stochastic Games
In this paper, we present algorithms for the solution of finite discounted stochastic games, without special structure. Three equilibrium concepts are consi...
BibTeX referenceA Network Approach to a Simultaneous Origin-Destination Assignment and Vehicule Routing Problem
The problem is to elaborate a minimum cost transportation plan by simultaneously solving the following two sub-problems: the assignment of available units at...
BibTeX reference
We discuss the performance of scheduling algorithms for a certain kind of manufacturing environment, called the "Flexible Flowshop", which consists of a cert...
BibTeX reference