Piece-wise optimal control in transport allocation problem
Placement de tâches dans un système distribué et dualité lagrangienne
Planificación multinivel con limitaciones de capacidad.
Este trabajo estudia el problema de la planificación de la producción en sistemas de fabricación multinivel, con un cuello de botella. El problema se ha abordado mediante una aproximación heurística, resolviendo el problema resultante empleando el método primal dual. El trabajo incluye un algoritmo para la selección sucesiva de los precios de los recursos que garanticen una mejora monótona hacia la solución óptima.
Planification à moyen terme de la production d'un satellite défilant et ensembles stables
Planification des emplois du temps et de la formation au sein d'une grande entreprise
Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise
We describe an O.R. technique which plans the allotment of time of the collaborators of a big company. The proposed method not only considers the immediate profitability of the company, but also the training of the collaborators in order to guarantee the success of the company's rising generation. The proposed method uses a greedy approach and constitutes therefore a simple and fast tool for decision makers. It has been successfully implemented in an important Swiss bank society.
Plus court chemin avec contraintes d'horaires
Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
p-Median problems in a fuzzy environment.
In this paper a formulation for the fuzzy p-median model in a fuzzy environment is presented. The model allows to find optimal locations of p facilities and their related cost when data related to the node demands and the edge distances are imprecise and uncertain and also to know the degree of certainty of the solution. For the sake of illustration, the proposed model is applied in a reduced map of Kinshasa (Democratic Republic of Congo) obtaining results which are rather than realistic ones.
Polar graphs and railway traffic
Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
We deal here with a scheduling problem GPPCSP (Generalized Parallelism and Preemption Constrained Scheduling Problem) which is an extension of both the well-known Resource Constrained Scheduling Problem and the Scheduling Problem with Disjunctive Constraints. We first propose a reformulation of GPPCSP: according to it, solving GPPCSP means finding a vertex of the Feasible Vertex Subset of an Antichain Polyhedron. Next, we state several theoretical results related to this reformulation process and...
Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula.
Pondération des variables pour la classification de données binaires
Postal System Strategy Selection by Applying Multicriteria Analysis
Potentiels sur un graphe non conjonctif et analyse d'un problème d'ordonnancement à moyens limites
Power Unit – Cargo Space Link in Transport
Preface to the Special Issue
Preventive Maintenance of Units Subject to Two Kinds of Wear Failure
Preventive replacement policies up to the first failure.