38 Cahiers pour l'année 1988
The problem of two processors in series and <i>n</i> parts is considered, when processing times depend on some state variable. It is first shown that the mi...
référence BibTeX
This paper presents a model for the optimization of productivity in a steel plant comprised of four arc furnaces and three continuous casting machines and su...
référence BibTeX
Ordered sets are used as a computational model for motion planning in which figures on the plane may be moved along a ray emanating from a light source. The...
référence BibTeX
The two-dimensional cutting-stock problem consists of laying out a specified list of rectangular pieces on rectangular sheets, in such a way as to minimize t...
référence BibTeX
This paper deals with a continuous-time stochastic control model designed for planning production and preventive maintenance in a flexible manufacturing syst...
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
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
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
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
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
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...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeXMinimisation 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...
référence BibTeX
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...
référence BibTeX
The Basic Algorithm of pseudo-Boolean programming due to Hammer and Rudeanu allows to minimize nonlinear 0-1 functions by recursively eliminating one variabl...
référence BibTeX
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...
référence BibTeX
We discuss the performance of scheduling algorithms for a certain kind of manufacturing environment, called the "Flexible Flowshop", which consists of a cert...
référence BibTeXA 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...
référence BibTeXAlgorithms 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...
référence BibTeX
This paper deals with a stochastic optimal control problem where the randomness is essentially concentrated in the stopping time terminating the process. If...
référence BibTeX
We present an algorithm that solve the problem of finding the best vehicle time schedule (minimizing total inconveniences) for a fixed path, knowing that vis...
référence BibTeX
Part-orienting systems are employed in many manufacturing environments to feed work parts in correct orientation for proper operations. A part-orienting sys...
référence BibTeX
We consider an oligopolistic industry extracting a non-renewable resource sold in a competitive market. We show, first, that if all players, but one, have i...
référence BibTeX
This paper deals with efficient computation of a certain type of Nash-Cournot equilibria in multi-stage oligopolies. The generic structure analyzed herein r...
référence BibTeX
Part-orienting systems are employed in many manufacturing environments to feed work parts in correct orientation for proper operations. A part-orienting sys...
référence BibTeX
Many problems of globally optimal design have been solved in the literature using monotonicity analysis and a variety of tests applied in an ad hoc way. The...
référence BibTeX
An experimental computer system for globally optimal design, called BAGOP, is discussed. This new tool uses the computer alebra system MACSYMA to implement ...
référence BibTeX
Scheduling methods are proposed for a class of flexible manufacturing systems consisting of machine centers served by a cyclic conveyor. The minimization of...
référence BibTeX
Many problems of globally optimal design have been solved by using monotonicity analysis. New monotonicity principles are obtained by exploiting non strict ...
référence BibTeX
The production scheduling problem considered in this paper is related to the planning of operations of a flexible manufacturing cell composed of a punch pres...
référence BibTeX
Ordered sequential algorithms for the global minimization of univariate functions over an interval proceed by evaluating this function at successive points c...
référence BibTeXMaximum Sum of Splits Clustering
Consider N entities to be classified, and a matrix of diffimilarities between pairs of them. The split of a cluster is the smallest dissimilarity between an...
référence BibTeX
This paper describes a family of stochastic location-routing problems which consist of simultaneously locating a depot among a set of potential sites, of det...
référence BibTeX
We propose a measure of the reliability of a telecommunication network based on the expected value of the lost call traffic due to failures in the network. ...
référence BibTeX
We consider a queue-like job shop in which a single resource (such as an operator, a robot, etc.) loads jobs onto machines. Jobs arrive at a station at know...
référence BibTeX
A decomposition method is proposed for minimizing quadratic pseudoboolean functions. The result is: minimum of <i>f</i> = ∑<sup>p</sup><sub><i>i</i>=...
référence BibTeX
In the class of piecewise deterministic systems such as presented by Richel [1975b], [1975c], one considers continuous-time systems disturbed by a jump proce...
référence BibTeX