Un couplage entre un algorithme génétique et un modèle de simulation pour l'ordonnancement à court terme d'un atelier discontinu de chimie fine

 Access to full text

 Full (PDF)

1. 1. J. M. ALLIOT, Techniques d'optimisation stochastique appliquées aux problèmes du trafic aérien, Habilitation à Diriger les Recherches, INPT, 28 Mai 1996. 
2. 2. P. BAUDET C. AZZARO-PANTEL, S. DOMENECH et L. PIBOULEAU, A discrete-event simulation model for batch chemical plant scheduling, ADEDOPS Workshop (workshop on analysis and design of event-driven operations in process Systems), Imperial College, Londres, 10-11 avril 1995. 
3. 3. P. BAUDET, C. AZZARO-PANTEL, S. DOMENECH, L. PIBOULEAU, Un modèle de simulation à événements discrets pour la gestion de production d'un atelier de chimie fine, Colloque modélisation des systèmes réactifs, AFCET, Brest, 28-29 mars, publié dans les actes du congrès, 1996, p. 211-221. 
4. 4. P. BAUDET, Ordonnancement à court terme d'un atelier discontinu de chimie fine; cas du fonctionnement job-shop, thèse de Doctorat, INP Toulouse, 1997. 
5. 5. G. BEL et D. DUBOIS, Modélisation et simulation des systèmes automatisés, RAIRO APII, 1985, 19, p. 42-52. Zbl0557.90042MR814472
6. 6. J. E. BIEGEL et J. J. DAVERN, Genetic algorithms and job-shop scheduling, Comp. Ind. Engng., 1990, 19, p. 81-91. 
7. 7. D. B. BIREWAR et I. E. GROSSMAN, Simultaneous production planning and scheduling in multiproduct batch plants, Ind. Eng. Chem. Res., 1990, 29, p. 570-580. 
8. 8. J. L. BLANTON et R. L. WAINWRIGHT, Multiple vehicle routing with time and capacity constraints using genetic algorithms, Proc. Of the Fifth Int. Conf. On Genetic Algorithms, 1993, p. 452-459. 
9. 9. A. BRINDLE, Genetic Algorithms for function optimization, Unpublished doctoral dissertation, University of Alberta, Edmonton, 1981. Zbl0436.65035
10. 10. M. CARTWRIGHT et A. LONG, Simultaneous optimization of chemical flowshop sequencing and topology using Genetic algorithms, Ind. Eng. Chem. Res., 1993, 32, p. 2706-2713. 
11. 11. M. CARTWRIGHT et A. TUSON, Genetic Algorithms and Flowshop Scheduling: Towards the Development of a Real-time Process Control System, AISB workshop on Evolutionary Computing, Leeds (GB), Avril 1994. 
12. 12. C. CAUX, H. PIERREVAL, M. C. PORTMANN, Les algorithmes génétiques et leur application aux problèmes d'ordonnancement, Journées d'études « ordonnancement et entreprise », Toulouse, Juin 1994. 
13. 13. C. CAUX, G. FLEURY, M. GOURGAND et P. KELLERT, Couplage méthodes d'ordonnancement-simulation pour l'ordonnancement de systèmes industriels de traitement de surfaces, RAIRO Oper. Res., 1995, 29, p. 391-413. 
14. 14. R. CERF, Une théorie asymptotique pour les algorithmes génétiques, Thèse, Montpellier 1994. 
15. 15. H. DAS, P. T. CUMMINGS et M. D. LE VAN, Scheduling of serial multiproduct batch processes via simulated annealing, Comp. Chem. Engng., 1990, 14, p. 1351-1362. 
16. 16. L. DAVIS, Job-shop scheduling with Genetic algorithms, Proc. 1th Conf. on Gas and their applications, Lawrence Erlbaum, Hillsdale, 1985, p. 136-140. Zbl0681.68043
17. 17. L. DAVIS, Handbook of Genetic algorithms, Van Nostrand Rienhold, Ed., New York, 1991. 
18. 18. K. A. DE JONG, An analsis of the behavior of a class of genetic adaptative Systems, Doctoral Dissertation, University of Michigan), Dissertation Abstract International, 36, p. 5140B. 
19. 19. L. DJERID et M. C. PORTMANN, Comment entrecroiser des procédures par séparation et évaluation et des algorithmes génétiques: Application à des problèmes d'ordonnancement à contraintes disjonctives, Francoro, Mons, Juin 1995. 
20. 20. U. M. EGLI et D. W. T. RIPPIN, Short term scheduling for multiproduct batch chemical plants, Comput. Chem. Engng., 1986, 10, p. 303-325. 
21. 21. A. E. EIBEN, E. H. L. AARTS et K. M. VAN LEE, Global convergence of genetics algorithms: a markov chain analysis, Proc. of the 1st workshop Ppsni, Dortmund, 1991. 
22. 22. A. ESPUNA et L. PUIGJANER, On the solution of the retrofitting problem for multiproduct batch semi-continuous chemical plants, Comput. Chem. Engng., 1989, 13, p. 483-490. 
23. 23. E. FALKENAUER et S. BOUFFOUIX, A genetic algorithm for job-shop, Proceedings of the IEEE Int. Conf. on Robotics and Automation, Sacramento, 1991, p. 824-829. 
24. 24. G. FLEURY, Application du recuit simulé et de ses variantes à des problèmes d'ordonnancement, Journées d'études « ordonnancement et entreprise », Toulouse, Juin 1994. 
25. 25. A. M. GILLIES, Machine learning procedures for generating image domain feature detectors, Unpublished doctoral dissertation, University of Michigan, Ann Arbor, 1985. 
26. 26. F. GLOVER, Future paths for integer programming and links to artificial intelligence, Compu. and Oper. Res., 1986, 13, p. 533-549. Zbl0615.90083MR868908
27. 27. D. E. GOLDBERG, Genetics algorithms in search, optimization and machine learning, Addison Wesley, Ed., 1989. Zbl0721.68056
28. 28. D. E. GOLDBERG, Les algorithmes génétiques, Addison Wesley, Ed., 1994. 
29. 29. Gotha, Les problèmes d'ordonnancement, RAIRO Recherche opérationnelle, 1993, 27, p. 77-150. MR1209112
30. 30. L. HERAULT, Réseaux neuromimétiques pour les problèmes d'ordonnancement - application à l'allocation de ressources, Journées d'études « ordonnancement et entreprise », Toulouse, Juin 1994. 
31. 31. J. HERTZ, A. KROGH et R. PALMER, Introduction to the theory of neural computation, Addison Wesley, 1991. MR1096298
32. 32. M. HOFMEISTER, L. HALASZ et D. W. T. RIPPIN, Knowledge-based tools for batch processing Systems, Third Conference on Process Systems Engineering, PSE'88, Comput. Chem. Engng., 1989, 13, p.1255-1261. 
33. 33. J. HOLLAND, Adaptation in natural and artificial Systems, Mit. Press, Cambridge, Mass., 1975. Zbl0317.68006MR441393
34. 34. S. KIRKPATRICK, C. D. GELATT et M. P. VECCHI, Optimization by simulated annealing, Resp. Rep. R. C. 9335, IBM TJW, Center Yorktown, NY, 1982. Zbl1225.90162
35. 35. H. Ku et I. A. KARIMI, Completion Time Algorithms for Serial Multiproduct Batch Processes with Shared Storage, Comput Chem. Engng., 1990, 14, p. 49-69. 
36. 36. H. Ku et I. A. KARIMI, Scheduling in serial multiproduct batch processes with due-date penalties, Ind. Eng. Chem. Res., 1990, 29, p. 580-590. 
37. 37. H. Ku et I. A. KARIMI, An evaluation of simulated annealing for batch process scheduling, Ind. Eng. Chem. Res., 1991, 30, p. 163-169. 
38. 38. K. KURIYAN, G. V. REKLAITIS et G. S. JOGLEKAR, Multiproduct plant scheduling studies using BOSS, Ind. Eng. Chem. Res., 1987, 26, p. 1551-1558. 
39. 39. K. KURIYAN et G. V. REKLAITIS, Scheduling network flowshops so as to minimize makespan, Comput. Chem. Engng., 1989, 13, p. 187-200. 
40. 40. P. J. M. LAARHOVEN, E. H. L. AARTS et J. K. LENSTRA, Job-shop scheduling by silulated annealing, Oper. Res., 1992, 40, p. 113. Zbl0751.90039MR1152731
41. 41. G. LAZAROS et C. PANTELIDES, Optimal Campaign Planning/Scheduling of Multipurpose Batch/Semicontinuous Plants. 1. Mathematical Formulation, Ind. Eng. Chem Res., 1996, 35, p. 488-509. 
42. 42. R. MUSIER et L. EVANS, An approximative method for the production scheduling of industrial batch processes with parallel units, Comput Chem. Engng., 1989, 13, p. 229-238. 
43. 43. J. P. NADAL, Réseaux de neurones, de la physique à la psychologie, Éditions Armand Colin, 1993. 
44. 44. R. NAKANO et T. YAMADA, Conventional Genetic algorithm for job-shop problems, Proc. 4th Int. Conf. on Gas, Kaufmann Ed., San Mateo, California, 1991, p. 474-479. 
45. 45. E. PEYROL, P. FLOQUET, L. PIBOULEAU et S. DOMENECH, Scheduling and simulated annealing. Application to a semiconductor circuit fabrication plant, Comput. Chem. Engng., 1993, 17, p. S39-44. 
46. 46. M. C. PORTMANN, Scheduling methodology: Optimization and compu-search approaches I, Production and scheduling of manufacturing Systems, Artiba A., Elmaghraby S.E., Eds., Chapman & Hall, 1996. 
47. 47. M. C. PORTMANN, Various genetic algorithm approaches for solving scheduling problem families, JETAI 96, Pavia, 21-23 mars 1996. 
48. 48. M. C. PORTMANN et F. GHEDJATI, Méthodes approchées pour le problème d'ordonnancement avec machines non identiques en parallèles et contraintes de précédence, Proceedings of AGI'94, Poitiers, Juin 1994. 
49. 49. D. RAJAGOLAPAN et I. A. KARIMI, Completion times in a serial mixed-storage multiproduct processes with transfer and set-up times, Comput Chem. Engng., 1989, 13, p. 175-186. 
50. 50. G. V. REKLAITIS, Overview on scheduling and planning of process operations, NATO Advanced Study Institute on Batch Processing Systems Engineering, Antalya, Turkey, 1992. 
51. 51. D.W.T. RIPPIN, Batch process Systems engineering: A retrospective and prospective review, Comput Chem. Engng., 1993, 17, p. S1-S536. 
52. 52. D. SMITH, Bin packing with adaptative search, Proc. of the First Int. Conf. on Genetic Algorithms, 1985, p. 202-207. Zbl0678.68086
53. 53. G. TAGUARINI, J. CHRIST et E. PAGE, Optimization using neural network, IEEE Trans. Comp., 1991, 40, p. 1347-1358. 
54. 54. M. TANDON, P. T. CUMMINGS et M. D. LE VAN, Scheduling of Multiple Products on Parallel Units with Tardiness Penalties using Simulated Annealing, Comput. Chem Engng., 1995, 19, p. 1069-1076. 
55. 55. A. G. TSIRUKIS et G. REKLAITIS, Feature extraction algorithms for constrained global optimisation. 1. Mathematical foundation, Ann. Oper. Res., 1993, 42, p. 229-273. Zbl0772.90062
56. 56. A. G. TSIRUKIS et G. REKLAITIS, Feature extraction algorithms for constrained global optimisation. 2. Batch process scheduling application, Ann. Oper. Res., 1993, 42, p. 225-312. Zbl0794.90041
57. 57. L. TUSON, The implementation of a Genetic algorithm for the scheduling and Topology optimisation of chemical flowshops, TRGA94-01, Oxford (UK), Juin 1994. 
58. 58. M. TSUYOSHI, M. KATSUMI et N. NOBUTO, Neural Network Approach for Minimizing the Makespan of the General Job-shop, Internat. J. Produc. Econom., 1994, 33, p. 67-74. 
59. 59. M. C WELLONS et G. V. REKLAITIS, Optimal Schedule for a Single-Product Production Line-I. Problem, Comput. Chem. Engng., 1989, 13, p. 201- 212 
60. 60. W. WIEDE, K. KURIYAN et G. V. REKLAITIS, Determination of completion times for serial multiproduct processes. 1. A two unit finite intermediate storage System, Comput. Chem. Engng., 1987, 11, p. 337-344. 
61. 61. W. WIEDE, K. KURIYAN et G. V. REKLAITIS, Determination of completion times for serial multiproduct processes. 2. A multi-unit finite intermediate storage System, Comput. Chem. Engng., 1987, 11, p. 345-356. 
62. 62. W. WIEDE, K. KURIYAN et G. V. REKLAITIS, Determination of completion times for serial multiproduct processes. 3. Mixed intermediate storage System, Comp. Chem. Engng., 1987, 11, p. 357-368. 
63. 63. A. YOUNG et G. V. REKLAITIS, Capacity expansion study of a batch production line, Ind. Eng. Chem. Res., 1989, 28, p. 772-777.