Papers by Jean-marie Proth
Practice of Petri Nets in Manufacturing
The Journal of the Operational Research Society, 1994
... This means in practice that good modeling disciplines are very important. ... 1.1(b) it is ob... more ... This means in practice that good modeling disciplines are very important. ... 1.1(b) it is obvious that the firing of /must be done after (causal dependence) that of e. Also, it is clear that twice b and с must precede the firing of d. Moreover, с and e define a conflict. ...
Existence of forecast horizons in undiscounted discrete-time lot size models
Operations research, Jan 1, 1990
Abstract We are concerned with a discrete-time undiscounted dynamic lot size model in which deman... more Abstract We are concerned with a discrete-time undiscounted dynamic lot size model in which demand and cost parameters are constant for an initial few periods. As our main result, we obtain an upper bound on the number of these periods which guarantees the optimality of the Economic Order Quantity (EOQ) as the size of the production lot to be produced in the first period. The upper bound is given and the optimality holds for every problem with an horizon not less than the upper bound and for the infinite horizon problem ...
Predicting travel time on urban networks using simulation
ABSTRACT
Estimating Travel Time in a Single Lane System
ABSTRACT
Thème 4 -Simulation et optimisation de systèmes complexes Projet IMARA Rapport de recherche n°547... more Thème 4 -Simulation et optimisation de systèmes complexes Projet IMARA Rapport de recherche n°5473 -Janvier 2005 -32 pages Résumé : Dans ce rapport de recherche, nous nous intéressons à la décomposition de réseaux urbains de grande taille en sous réseaux de taille limitée. Nous cherchons à minimiser les connexions entre sous réseaux. En d'autres termes, nous cherchons à minimiser le nombre de noeuds situés à la frontière entre sous réseaux. Ce travail s'intègre dans une démarche qui a pour but de fournir aux conducteurs de véhicules automobiles un support qui leur permet de trouver le chemin le plus rapide entre deux localisations données. Deux algorithmes notés RP-1 et RP-2 sont présentés dans ce qui suit. Dans chacun de ces algorithmes, chaque noeud constitue initialement un sous réseau. Dans le premier algorithme, deux sous réseaux sont agrégés à chaque pas. Les deux sous réseaux choisis sont ceux qui conduisent au sous réseau de densité minimale. La densité d'un sous réseau est le quotient du nombre de noeuds situés sur la frontière par le nombre de noeuds du sous réseau. Dans le second algorithme, nous choisissons le sous réseau de densité maximale et nous lui agrégeons le sous réseau densité maximale qui lui est connecté. Nous poursuivons le processus jusqu'à atteindre la taille maximale acceptée, puis nous recommençons le processus jusqu'à épuisement des noeuds. Dans le second algorithme, l'intensité est définie comme le rapport entre le nombre de connexions entre les sous réseaux et le nombre de noeuds dans le sous réseau agrégé. Ces deux algorithmes sont ensuite comparés, puis appliqués à un vaste réseau de la Ville de Paris.
In this paper, we address the problem of production systems having two characteristics. First, th... more In this paper, we address the problem of production systems having two characteristics. First, the manufacturing times can be chosen between g iven bounds. Such a production system is said to have controllable processing times. Second, an operation must start as soon as the previous operation on the same part (if any) is completed. A production system having this characteristic
Production planning using mixed lots
1997 IEEE 6th International Conference on Emerging Technologies and Factory Automation Proceedings, EFTA '97, 1997
We consider the production planning of a manufacturing system capable of producing several types ... more We consider the production planning of a manufacturing system capable of producing several types of part. The demands are known at the end of each elementary period (at the end of each day or week for instance). The objective function (i.e. the criterion) is the sum of inventory, backlogging and set-up costs on a finite horizon. We use the concept
Gestion D'un Stock Multi-Produits Avec Couts Concaves Et Incitation Aux Lancements Groupes : Une Heuristique
Lecture Notes in Control and Information Sciences, 1984
This paper is devoted to the multi-product lot size model with concave costs, the production cost... more This paper is devoted to the multi-product lot size model with concave costs, the production cost being joint. We give an heuristic which leads to a "good" solution, the amount of computation being only proportional to N * M, where N is the horizon of the problem and M the number of products involved.
A systems‐based approach for city logistics decision making
Journal of Advances in Management Research, 2006
This paper presents a systems based approach for the city logistics decision making. Using this a... more This paper presents a systems based approach for the city logistics decision making. Using this approach, we present the layout of a simulation model called CILOSIM (CITY-LOGISTICS-SIMULATION). CILOSIM encapsulates three sub-models namely Goods to Vehicle Assignment model, Goods movement model and Impact assessment model. The Goods to vehicle assignment model allocates commodities to vehicles. The Goods movement model performs the
The impulse control problem with concave costs: On the search of planning horizons
This paper is devoted to the continuous time problems with concave costs in the case of no backlo... more This paper is devoted to the continuous time problems with concave costs in the case of no backlogging and impulse control.
Planification de systèmes d'assemblage avec approvisionnements aléatoires en composants
Journal of Decision Systems, 1995
We are interested in the management of an assembly system. Some components can be used for assemb... more We are interested in the management of an assembly system. Some components can be used for assembling different products. Each product need several components of various types to be manufactured. Components are ordered to companies which usually cannot guarantee a fix delivery time. In other words, the delivery times are random. The costs to be taken into account are the
Engineering Costs and Production Economics, 1988
This paper describes a medium term production management model, where the system is partitioned i... more This paper describes a medium term production management model, where the system is partitioned into production subsystems and part .families. The goal qf this research is to evaluate ihe production rate, ulhich minimizes the cumulative inventoq* cost over n given planning horizon.
Engineering Costs and Production Economics, 1988
This paper describes a medium term production management model, where the system is partitioned i... more This paper describes a medium term production management model, where the system is partitioned into production subsystems and part .families. The goal qf this research is to evaluate ihe production rate, ulhich minimizes the cumulative inventoq* cost over n given planning horizon.
CLASS: Computerized LAyout Solutions using Simulated annealing
International Journal of Production Research, 1992
... 1,95-108 CLASS: Computerized LAyout ~olutiol1s using Simulated annealing SATISH JAJODlA,t IOA... more ... 1,95-108 CLASS: Computerized LAyout ~olutiol1s using Simulated annealing SATISH JAJODlA,t IOANNIS MINIS,t GEORGE HARHALAKISt and JEAN-MARIE PROTH§ ... 1983, Vecchi and Kirkpatrick 1983, Darema et al. 1987, Casotto el al. 1987 and Kravitz and Rutenbar 1987). ...
A Cross-Decomposition Method for Layout Systems and Scheduling Problem
CAD/CAM Robotics and Factories of the Future, 1989
A Cross-Decomposition Method for Layout Systems and Scheduling Problem
CAD/CAM Robotics and Factories of the Future, 1989
Scheduling no-wait production with time windows and flexible processing times
IEEE Transactions on Robotics and Automation, 2001
This paper presents a low-complexity algorithm for online job scheduling at workcenters along a g... more This paper presents a low-complexity algorithm for online job scheduling at workcenters along a given route in a manufacturing system. At each workcenter, the job has to be processed by any one of a given set of identical machines. Each machine has a preset schedule of operations, leaving out time-windows during which the job's processing must be scheduled. The manufacturing
Group technology in production management: The short horizon planning level
Applied Stochastic Models and Data Analysis, 1985
Group technology in production management: The short horizon planning level
Applied Stochastic Models and Data Analysis, 1985
Inventory planning in a deterministic environment: Continuous time model with concave costs
European Journal of Operational Research, 1984
Uploads
Papers by Jean-marie Proth