Solving scheduling problems using Petri nets and constraint logic programming

RAIRO Recherche Operationnelle

Volumn 32, Issue 2, 1998, Pages 125-143

  Richard, P ^a   Proust, C ^a  

^a UNIVERSITÉ DE TOURS   (France)

Author keywords

Constraint Logic Programming; Petri nets; Scheduling

Indexed keywords

EID: 0000523584     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro/1998320201251     Document Type: Article

References (43)

1. R. L. ACKOFF, Optimization+ objectivity = opt out, European Journal of Operational Research, 1977, 1.
2. 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.
3. K. R. BAKER, Introduction to sequencing and scheduling. John Wiley & Sons.
4. A. BAUER, R. BOWDEN, J. BROWNE, J. DUGGAN and G. LYONS, Shop floor Control Systems - From design to implementation, 1991, Chapman & Hall.
5. 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.
6. P. BAPTISTE, B. LEGEARD and H. ZIDOUM, Sequences constraint solver based on P-Q-R trees, ILPS'94, New York, 1994, 14 p.
7. J. CARLIER and P. CHRÉTIENNE, Problèmes d'ordonnancement (modélisation/complexité/algorithmes), Masson, collection Études et Recherche en Informatique, 1987.
8. J. CARLIER and P. CHRÉTIENNE, Timed Petri net Schedules, Advances on Petri nets, 1988, Springer Verlag.
9. 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.
10. 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.
11. P. CHRÉTIENNE, Réseaux de Petri temporisés, thèse d'état, Paris VI, 1983.
12. F. CHU, J. M. OROTH and V. M. SAVI, Ordonnancement basé sur les réseaux de Pétri, Rapport de Recherche INRIA, 1993, no 1960.
13. A. COLMERAUER, An introduction to Prolog III, Communications of the ACM, 1990, 33, (7), pp. 69-90.
14. Cosytec, 1993, CHIP V4, user manual, Cosytec.
15. F. DICESARE, G. HARHALAKIS, J.-M. PROTH, M. SILVA and F. B. VERNADAT, Practice of Petri nets in manufacturing Systems, Chapman et Hall, 1993.
16. R. FOURE D. M. GAY and B. W. KERNIGHAN, AMPL: A Modelling language for mathematical programming, The scientific Press, 1993.
17. S. FRENCH, Sequencing and scheduling: an introduction to the mathematics of the Job-Shop, Ellis Horwood, 1982.
18. GOThA (Groupe d'Ordonnancement Théorique et Appliquée), Les problèmes d'ordonnancement, RAIRO-Operations Research, 1993, 27, (1), pp. 77-150.
19. 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.
20. IJPR, International Journal of Production Research, Special Artificial intelligence in manufacturing, 1988, 26, (5).
21. 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.
22. S. M. JOHNSON, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistic Quality, 1954, 1, (1), pp. 61-68.
23. 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.
24. 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.
25. e Congrès Reconnaissance des Formes et Intelligence Artificielle, Paris, France, 1994a.
26. 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.
27. M.-L. LEVY, P. LOPEZ and B. PRADIN, Characterization of feasible schedules for the flow-shop problem: a decomposition approach, INRIA European Workshop on Integrated manufacturing Systems Engineering (IMSE'94), Grenoble, 1994, pp. 307-315.
28. A. MUNIER, Régime asymptotique des graphes d'événements temporisés généralisés : application àun problème d'assemblage, RAIRO-APII, 1993, 27, (5), pp. 487-513.
29. T. MURATA, Petri nets: Properties, Analysis and Applications, Proceedings of the IEEE, 1989, 77, (4), pp. 541-580.
30. 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.
31. 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.
32. C. RAMCHANDANI, Analysis of asynchronous concurrent systems by timed Petri nets, Ph. D. Thesis, MIT, Cambridge, Project MAC-TR 120, 1974.
33. 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.
34. e International Conference on Manufacturing Automation, Nancy, 1995a, pp. 135-140.
35. 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.
36. 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.
37. B. ROY, Algèbre moderne et théorie des graphes, vol. 2, Dunod.
38. E. F. STAFFORD, F. T. TSENG, On the Srikar-Gosh MILP model for the NxM SDST flow-shop problem, International Journal of Production Research, 1990, 28, (10), pp. 1817-1830.
39. 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.
40. 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.
41. Van HENTENRYCK, Constraint satisfaction in logic programming, MIT press, 1989.
42. H. ZIDOUM, P, BAPTISTE and B. LEGEALRD, Extension de la PLC pour le traitement des contraintes sur les séquences, MSCEAI'94, Rabat, 1994, pp. 285-294.
43. 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.