Cahiers du GERAD par année

Liste chronologique

Recherche

52 Cahiers pour l'année 1989

We consider nonlinear programs in 0-1 variables with nonlinear constraints and survey the main approaches to their solution: (i) linearization; (ii) algebra...

référence BibTeX
, , , et

In many manufacturing systems, parts must be fed to automatic machines in a specific orientation. This is often accomplished by what are known as part orien...

référence BibTeX

We consider the directed graph representing the obstruction relation between objects moving along the streamlines of a two-dimensional velocity field. A col...

référence BibTeX

A new branch-and-bound algorithm for linear bilevel programming is proposed. Necessary optimality conditions expressed in terms of tightness of the follow...

référence BibTeX
, , , et

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

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

Nilsson recently introduced a rigorous semantic generalization of logic in which the truth values of sentences are probability values. This led to state pre...

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

Consider <i>N</i> entities to be classified, with given weights, and a matrix of dissimilarities between pairs of them. The split of a cluster is the small...

référence BibTeX
et

In this paper we address the problem of simultaneously selecting the composition and routing of a fleet of vehicles in order to efficiently service customer...

référence BibTeX

The concept of moduloïd over a dioïd has been introduced in M. Gondran and M. Minoux [8] for the algebraic structure left invariant under the action of a ma...

référence BibTeX

The purpose of this paper is to describe the correspondence between certain natural substructures of Boolean rings, of Boolean lattices, and of hypercubes d...

référence BibTeX
, et

The problem we consider is that of preparing a minimum cost transportation plan by simultaneously solving the following two sub-problems: first the assignm...

référence BibTeX

We consider the following global optimization problems for a univariate Lipschitz function <i>f</i> defined on an interval [<i>a,b</i>]: Problem <i>P</i>: f...

référence BibTeX

We consider the following global optimization problems for a Lipschitz function <i>f</i> implicitly defined on an interval [<i>a,b</i>]. Problem <i>P'</i>:...

référence BibTeX

We determine here sufficient conditions for finite dimensional moduloïds and pseudomodules to be lattices. As could be expected, completeness of the scalar ...

référence BibTeX
, , , , et

We report on the development of a linear process model of energy supplies and uses in the province of Ontario (Canada). The minerals industries producing ...

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

We consider the problem of scheduling jobs on a single machine with generalized due dates. The due dates are given according to the position in which a job ...

référence BibTeX

Global optimization problems with a few variables and constraints arise in numerous applications but are seldom solved exactly. Most often only a local opti...

référence BibTeX
, et

We investigate the complexity of openshop scheduling problems. A number of variations of the shop with different objective functions have been surveyed. The...

référence BibTeX
et

Schedule compression is a major concern in project management. We propose an extension of the classical crashing model to include the managerial practice of...

référence BibTeX

In this paper a study of Second and Third Degree Stochastic Dominances for the family of concave and convex utility functions is proposed. This is a modific...

référence BibTeX

Un ensemble d'algorithmes permettant de confectionner les itinéraires et l'horaire des véhicules en vue du transport de personnes handicapées est présenté. ...

référence BibTeX

This paper develops a conceptual framework for flexibility. A definition of flexibility is presented that is general enough to be applicable to all areas o...

référence BibTeX
et

This paper shows how the subtour elimination constraints developed by Miller, Tucker and Zemlin for the traveling salesman problem can be improved and exten...

référence BibTeX
et

The transient statistical evolution of a single product manufacturing system under hedging point control policies is characterized via a system of coupled p...

référence BibTeX

The aim of this paper is the characterization and the computation of equilibrium solutions in multistage games represented by networks. More specifically, w...

référence BibTeX
et

Consider the optimal control problem for the two processor flow-shop when processing time is a (linear) function of the state. Since the latter also depends...

référence BibTeX

We present an algorithm that solves the problem of finding the vehicle schedule which minimizes total inconveniences for travel along a fixed path, where se...

référence BibTeX

The multiple vehicle many-to-many routing problem is presented in the context of a dial-a-ride system. It is solved by mini-clustering first and optimal ro...

référence BibTeX
et

We consider projects represented by a PERT network, with convex cost-of-time functions on individual activities, and we show the existence of an efficient m...

référence BibTeX

The interaction between a utility company and electricity cogenerators is modeled via a game-theoretic, systems analysis approach, under the assumption of a...

référence BibTeX

Piyavskii's algorithm maximizes a univariate function <i>f</i> satisfying a Lipschitz condition. We compare the numbers of iterations needed to obtain a bou...

référence BibTeX
et

In this paper, we address the problem of routing a fleet of vehicles from a central depot to customers with known demands. We consider the classical vehicle...

référence BibTeX
, , , et

We outline a system that is being designed to support the modeling of physical distribution situations and the selection or construction of algorithms for t...

référence BibTeX
et

This paper establishes a relationship between the concept of hedging point, first introduced in the realm of FMS flow control models, and the turnpike prop...

référence BibTeX
, et

Several single-commodity, two-commodity and multi-commodity flow formulations have recently been introduced for the travelling salesman problem. The purpose...

référence BibTeX
, et

Le problème classique d'optimisation de la capacité des réseaux de télécommunications s'énonce comme suit: pour un réseau dont la structure, la demande et l...

référence BibTeX
, et

This paper deals with an application of the projective algorithm to the solution of a generic nondifferentiable minimization problem. This problem is closel...

référence BibTeX
et

The primal projective algorithm for linear programs with unknown optimal objective function value is extended to the case where one uses a weighted Karmarka...

référence BibTeX
et

Given a weighted graph with profits associated with the vertices, the selective travelling salesman problem (or orienteering problem) consists of selecting ...

référence BibTeX
et

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

référence BibTeX

A certain sequential separability property is established, using a topological argument, and exploiting a convexity-type assumption about objects with direc...

référence BibTeX

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

référence BibTeX

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

référence BibTeX
, , , et

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

référence BibTeX
, et

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

référence BibTeX

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

référence BibTeX

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

référence BibTeX

This research review presents very recent results in the theory of deterministic scheduling in production systems. The deterministic models dealt with inclu...

référence BibTeX

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

référence BibTeX