Cahiers du GERAD
Search
Chronological list
3159 results — page 144 of 158
In this paper, we deal with the problem of sequencing parts and robot moves in a robotic cell where the robot is used to feed machines in the cell. The robo...
BibTeX reference
L'algèbre (max, +) est un outil important en Recherche Opérationnelle et en Automatique dans le contexte de l'analyse des systèmes à événements discrets. L'...
BibTeX reference
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 ...
BibTeX reference
We analyze the vehicle routing problem with constraints on the total distance traveled by each vehicle. Two objective functions are considered: minimize t...
BibTeX reference
It is proved that for any hexagonal system, there is a peak and a valley which are border adjacent (the path from the peak to the valley along the border is...
BibTeX reference
Among orders that arise from obstructions between geometric or abstract objects, certain lattices and lattice-like structures appear distinctively. This pap...
BibTeX reference
In many cities around the world, public transportation services are requested to provide adapted transportation for handicapped persons and people with rest...
BibTeX reference
In this article, a MARKAL model of electricity trading between four regions is presented and used to simulate the advantages derived from cooperative planni...
BibTeX reference
L'objectif de cet article est d'analyser les facteurs de succès et d'échec de nouveaux produits de consommation et industriels. Les résultats des analyses d...
BibTeX reference
We show that in most interesting cases where infinitesimal perturbation analysis (IPA) applies for derivative estimation, a finite-difference scheme with co...
BibTeX referenceSlightly Hard-to-Color Graphs
A graph is said to be slightly hard to color for a given vertex-coloring heuristic if some implementation of the algorithm uses more colors than are necessa...
BibTeX reference
The purpose of this paper is twofold. First, we revisit the cent-dian location problem developed by Halpern, considering both the average and maximum distan...
BibTeX reference
We propose an algorithm to compute the optimum departure time and path for a commuter in a congested network. Constant costs for use of arc, cost functions ...
BibTeX reference
We analyze a class of combined random number generators proposed by L'Ecuyer (1988), which combines a set of linear congruential generators (LCGs) with dist...
BibTeX reference
We describe different derivative estimators for the case of steady-state performances measures and obtain the order of their convergence rates. These estima...
BibTeX reference
In this paper, we propose three combined Tausworthe random number generators with period length about 10<sup>18</sup>, whose <i>k</i>-distribution propertie...
BibTeX reference
La génération d'implantation est un domaine privilégié pour l'application des modèles d'optimisation. Il est proposé, ici, une méthode d'évaluation d'implan...
BibTeX reference
Layout planning is an appropriate area in which to apply optimization models. A method is proposed here for evaluating general layouts (block layouts) when ...
BibTeX reference
Nilsson recently introduced a rigorous semantic generalization of logic in which the truth values of sentences are probability values. This led to state pre...
BibTeX reference
We describe a new class of graphs for which the stability number can be obtained in polynomial time. The algorithm is based on an iterative procedure which...
BibTeX reference