EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 32 / No 2 (1998) RAIRO-Oper. Res., 32 2 (1998) 125-143 References
Free Access
Issue
RAIRO-Oper. Res.
Volume 32, Number 2, 1998
Page(s) 125 - 143
DOI https://doi.org/10.1051/ro/1998320201251
Published online 10 February 2017
  • R. L. ACKOFF, Optimization + objectivity = opt out, European Journal of Operational Research, 1977, 1. [Zbl: 0366.90034] [Google Scholar]
  • A. AGGOUN and N. BELDECEANU, Extending CHIP in order to solve complex scheduling and placement problems, Mathematical and computer modelling, 1993, 17, (7), pp. 57-73. [Google Scholar]
  • K. R. BAKER, Introduction to sequencing and scheduling, John Wiley & Sons. [Google Scholar]
  • A. BAUER, R. BOWDEN, J. BROWNE, J. DUGGAN and G. LYONS, Shop floor Control Systems - From design to implementation, 1991, Chapman & Hall. [Google Scholar]
  • P. BAPTISTE, C. H. CHO, J. FAVREL et M. ZOUHRI, Une caractérisation analytique des ordonnancements admissibles sous contraintes hétérogènes en flow-shop, RAIRO-APII, 1991, 25, pp. 87-102. [Zbl: 0726.90034] [Google Scholar]
  • P. BAPTISTE, B. LEGEARD and H. ZIDOUM, Sequences constraint solver based on P-Q-R trees, ILPS'94, New York, 1994, 14 p. [Google Scholar]
  • J. CARLIER and P. CHRÉTIENNE, Problèmes d'ordonnancement (modélisation/complexité/algorithmes), Masson, collection Études et Recherche en Informatique, 1987. [Zbl: 0494.90040] [MR: 924578] [Google Scholar]
  • J. CARLIER and P. CHRÉTIENNE, Timed Pétri net Schedules, Advances on Petri nets, 1988, Springer Verlag. [MR: 1025816] [Zbl: 0667.68051] [Google Scholar]
  • C. CAVALIER, N. JACQUET and P. RICHARD, Problèmes d'ordonnancement en Flowshop: Réseaux de Petri et PLC, Rapport de Projet de Fin d'études de l'École d'Ingénieurs en Informatique pour l'Industrie (E31), Université de Tours, 1995, France. [Google Scholar]
  • C. W. CHENG, T. H. SUN and L. C. Fu, Petri net based modelling and scheduling of flexible manufacturing system, IEEE International Conference on Robotics and Automation, 1994, pp. 513-520. [Zbl: 1136.90344] [Google Scholar]
  • P. CHRÉTIENNE, Réseaux de Petri temporisés, thèse d'état, Paris VI, 1983. [Google Scholar]
  • F. CHU, J. M. PROTH and V. M. SAVI, Ordonnancement basé sur les réseaux de Petri, Rapport de Recherche INRIA, 1993, n° 1960. [Google Scholar]
  • A. COLMERAUER, An introduction to Prolog III, Communications of the ACM, 1990, 33, (7), pp. 69-90. [Zbl: 0679.68045] [Google Scholar]
  • Cosytec, 1993, CHIP V4, user manual, Cosytec. [Google Scholar]
  • F. DICESARE, G. HARHALAKIS, J.-M. PROTH, M. SILVA and F. B. VERNADAT, Practice of Petri nets in manufacturing Systems, Chapman et Hall, 1993. [Google Scholar]
  • R. FOURE D. M. GAY and B. W. KERNIGHAN, AMPL: A Modelling language for mathematical programming, The scientific Press, 1993. [Zbl: 0701.90062] [Google Scholar]
  • S. FRENCH, Sequencing and scheduling: an introduction to the mathematics of the Job-Shop, Ellis Horwood, 1982. [MR: 642978] [Zbl: 0479.90037] [Google Scholar]
  • GOThA (Groupe d'Ordonnancement Théorique et Appliquée), Les problèmes d'ordonnancement, RAIRO-Operations Research, 1993, 27, (1), pp.77-150. [EuDML: 105053] [Google Scholar]
  • H. HILLION and J.-M. PROTH, Performance evaluation of job-shop Systems using timed event graphs, IEEE Transactions on Automatic Control, 1989, 34, (1), pp. 3-9. [MR: 970927] [Zbl: 0656.90054] [Google Scholar]
  • IJPR, International Journal of Production Research, Special Artificial intelligence in manufacturing, 1988, 26, (5). [Google Scholar]
  • S. JULIA R. VALETTE and M. TAZZA, Analysis of the behavior of a manufacturing cell with cyclic feeding policies, IEEE-SMC, San Antonio, 1994, pp. 1683-1688. [Google Scholar]
  • S. M. JOHNSON, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistic Quality, 1954, 1, (1), pp.61-68. [Google Scholar]
  • E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY Kan and D. B. SHMOYS, Sequencing and Scheduling: algorithms and complexity, Report BS-R8909, Center for Mathematics and Computer Science, Amsterdam, The Netherlands, 1989. [Google Scholar]
  • D. Y. LEE and F. DICESARE, Scheduling flexible manufacturing Systems using petri nets, and heuristic search, IEEE transactions on robotics and automation, 1994, 10, (2), pp. 123-132. [Google Scholar]
  • C. LE PAPE, Programmation par contraintes et ordonnancement : historique et perspectives, Tutorial, 9e Congrès Reconnaissance des Formes et Intelligence Artificielle, Paris, France, 1994a. [Google Scholar]
  • C. LE PAPE, Implementation of resource constraints in Ilog Schedule: a library for the development of constraint-based scheduling Systems, Intelligent Systems Engineering, 1994b, 3, pp. 55-66. [Google Scholar]
  • M.-L. LEVY, P. LOPEZ and B. PRADIN, Characterization of feasible schedules for the flowshop problem: a decomposition approach, INRIA European Workshop on Integrated manufacturing Systems Engineering (IMSE'94), Grenoble, 1994, pp. 307-315. [Google Scholar]
  • A. MUNIER, Régime asymptotique des graphes d'événements temporises généralisés : application à un problème d'assemblage, RAIRO-APII, 1993, 27, (5), pp. 487-513. [Zbl: 0801.90056] [Google Scholar]
  • T. MURATA, Petri nets: Properties, Analysis and Applications, Proceedings of the IEEE, 1989, 77, (4), pp.541-580. [Google Scholar]
  • J.-M. PROTH and X. XIE, Les réseaux de Petri pour la conception et la gestion des systèmes de production, Masson, Paris, 1994. [Google Scholar]
  • C. PROUST, Using Johnson's algorithm for solving flow-shop scheduling problems, Proceedings of the summer school on Scheduling Theory and its Application, INRIA, Bonnas, 1992. [Google Scholar]
  • C. RAMCHANDANI, Analysis of asynchronous concurrent Systems by timed Petri nets, Ph. D. Thesis, MIT, Cambridge, Project MAC-TR 120, 1974. [Google Scholar]
  • P. RICHARD, J. L. BOUQUARD and C. PROUST, Resolution of scheduling problems by modelling with Petri nets and a transcription in CHIP, INRIA European Workshop on Integrated Manufacturing Systems Engineering (IMSE'94), Grenoble, 1994, pp. 317-323. [Google Scholar]
  • P. RICHARD, J. L. BOUQUARD and C. PROUST, Scheduling based on Petri nets and a resolution with CHIP, 2e International Conference on Manufacturing Automation, Nancy, 1995a, pp. 135-140. [Google Scholar]
  • P. RICHARD, C. CAVALIER, N. JACQUET and C. PROUST, Solving scheduling problems using Petri nets and constraint logic programming, INRIA/IEEE International Symposium on Emerging Technologies and Factory Automation (ETFA'95), Paris, 1995b, 9 p. [Google Scholar]
  • ROUBELLAT, J. C. BILLAUT and M. VILLAUMIÉ, Ordonnancement d'atelier en temps réel d'Orabaid à Ordo, Proceedings, journées d'études Ordonnancement et entreprises: applications concrètes et outils pour le futur, CNRS/GdR Automatique/SED/GT3, Toulouse, 1994, pp. 213-253. [Google Scholar]
  • B. ROY, Algèbre moderne et théorie des graphes, vol. 2, Dunod. [Zbl: 0238.90073] [Google Scholar]
  • E. F. STAFFORD, F. T. TSENG, On the Srikar-Gosh MILP model for the N x M SDST flow-shop problem, International Journal of Production Research, 1990, 28, (10) pp. 1817-1830. [Google Scholar]
  • D. R. SULE, K. Y. HUANG, Sequencing on two and three machines with setup, processing and removal times separated, International Journal of Production Research, 1983, 21, (5), pp. 723-732. [Zbl: 0516.90038] [Google Scholar]
  • C. VALENTIN, L. M. AGUILERA, P. LADET and Z. BINDER, A high level Petri nets model of generalized dynamic job-shop, European Workshop on Integrated manufacturing Systems Engineering (IMSE'94), INRIA, Grenoble, 1994, pp. 273-280. [Google Scholar]
  • Van HENTENRYCK, Constraint satisfaction in logic programming, MIT press, 1989. [MR: 1013366] [Google Scholar]
  • H. ZIDOUM, P. BAPTISTE and B. LEGEARD, Extension de la PLC pour le traitement des contraintes sur les séquences, MSCEAFI'94, Rabat, 1994, pp. 285-294. [Google Scholar]
  • M. C. ZHOU and F. DICESARE, Parallel and sequential mutual exclusions for Petri net modelling of manufacturing Systems with shared resources, IEEE transactions on Robotics and Automation, 1991, 7, (4), pp.515-527. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.