Les problèmes d'ordonnancement

 Access to full text

 Full (PDF)

1. [ACHU 82] J. O. ACHUGBUEet F. Y. CHIN, Complexity and Solution of Some Three-Stage Flow-Shop Scheduling Problem, Math. Opns. Res., 1982, 7, p. 532-544. Zbl0498.90043MR686529
2. [ADAM 88] J. ADAMS, E. BALASet D. ZAWACK, The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Sci., 1988, 34, p. 391-401. Zbl0637.90051MR938771
3. [AIKE 88] A. AIKENet A. NICOLAU, Optimal Loop Parallelization, Proc. of the SIG-PLAN'88 Conf. on Prog. Language Design an Implementation, Atlanta, U.S.A., june 1988, p. 308-317. 
4. [ANGE 87] B. ANGENIOL, G. DE LA CROIX VAUBOISet J.-Y. LE TEXIER, Self Organizing Features Maps on the Travelling Salesman Problem, Rapport Interne Thomson C.S.F./D.S.E., 1987. 
5. [AXSA 84] S. AXSATERet H. JONSSON, Aggregation and Dissaggregation in Hierarchical Production Planning, EJOR, 1984, 17, p. 338-350. MR759819
6. [BAKE 74] K. R. BAKER, Introduction to Sequencing and Scheduling, John Wiley, 1974. 
7. [BAKE 90] K. R. BAKER, Scheduling Groups of Jobs in the Two-Machine Flow Shop, Math. Comput. Modelling, 1990, 13, 3, p. 29-36. MR1047077
8. [BELL 82] R. BELLMAN, A. O. ESOGBUEet I. NABESHIMA, Mathematical Aspects of Scheduling and Applications, Pergamon Press, Oxford, England, 1982. Zbl0498.90018MR680400
9. [BIEG 90] J. E. BIEGELet J. J. DAVERN, Genetic Algorithms and Job Shop Scheduling, Comput. ind. Engng., 1990, 19, 1/4, p. 81-91. 
10. [BITR 82] G. R. BITRAN, E. A. HAASet A. C. HAX, Hierarchical Production Planning: a Two Stage System, Opns. Res., 1982, 30, p. 232-251. Zbl0481.90040
11. [BRUC 91] P. BRUCKER, B. JURISHet B. SIEVERS, A Branch and Bound Algorithm for the Job Shop Scheduling Problem, Disc. Appl. Math. (à paraître). Zbl0802.90057
12. [BLAZ 83] J. BLAZEWICZ, J. K. LENSTRAet A. H. G. RINNOOY KAN, Scheduling Subject to Resource Constraints: Classification and Complexity, Disc. Appl. Math., 1983, 5, p. 11-24. Zbl0516.68037MR678815
13. [BLAZ 86] J. BLAZEWICZ, W. CELLARY, R. SLOWINSKIet J. WEGLARZ, Scheduling Under Resource Constraints: Deterministic Models, Annals of Opns. Res., J. C. Baltzer AG, Basel, 1986. Zbl0668.90045
14. [CARL 75] J. CARLIER, Disjonctions dans les ordonnancements, RAIRO-Oper. Res., juin 1975, 2, p. 83-100. Zbl0339.90031
15. [CARL 78] J. CARLIER, Ordonnancements à Contraintes Disjonctives, RAIRO-Oper. Res., novembre 1978, 12, p. 333-351. Zbl0401.90052MR516514
16. [CARL 82 a] J. CARLIERet A. H. G. RINNOOY KAN, Financing and Scheduling, Opns. Res. Letters, avril 1982, 1, 2, p. 52-55. Zbl0494.90041
17. [CARL 82 b] J. CARLIERet P. CHRETIENNE, Les Problèmes d'ordonnancement : un domaine très ouvert, RAIRO-Oper. Res., août 1982, p. 175-217. Zbl0494.90040
18. [CARL 82 c] J. CARLIER, The One Machine Problem, EJOR, 1982, p. 42-47. Zbl0482.90045
19. [CARL 84] J. CARLIER, P. CHRETIENNEet C. GIRAULT, Modelling Scheduling Problems with Timed Petri Nets, Advances Studies in Petri Nets, Lecture Notes in Comput. Sci., Springer Verlag, september 1984. Zbl0562.68050MR807195
20. [CARL 88 a] J. CARLIERet P. CHRETIENNE, Les problèmes d'ordonnancements : modélisation, complexité, algorithmes, Masson, Paris, février 1988. 
21. [CARL 88 b] J. CARLIERet C. PRINS, Optimisation des plans de trame dans le système AMRT/CNC d'EUTELSAT, Annales des Télécomm., 1988, 43, 9-10, p. 506-521. 
22. [CARL 89 a] J. CARLIERet P. CHRETIENNE, Timed Petri Nets Schedules, Advances in Petri Nets 1988, Lecture Notes in Comput. Sci., Springer Verlag, january 1989, p. 62-84. Zbl0667.68051MR1025816
23. [CARL 89 b] J. CARLIERet E. PINSON, A Branch and Bound Method for Solving the Job Shop Problem, Management Sci., february 1989, 35, 2, p. 164-176. Zbl0677.90036MR985230
24. [CARL 89 c] J. CARLIER, Scheduling under Financial Constraints, Advances in Project Scheduling (R. Slowinsky et J. Weglarz éds.), Elsevier science, april 1989, p. 187-224. MR1060136
25. [CARL 90] J. CARLIERet E. PINSON, The Use of the Jackson Preemptive Schedule for Solving the Job Shop Problem, Annals of Opns. Res., 1990 (à paraître). Zbl0709.90061
26. [CARL 92] J. CARLIERet L. TAVARES éd., Project Management and Scheduling 2, EJOR, Special Issue (à paraître). 
27. [CHO 81] Y. CHOet S. SAHNI, Preemptive Scheduling of Independent Jobs with Release and Due Dates on Open, Flow and Job Shops, Opns Res., 1981, 29, p. 511-522. Zbl0455.90043MR629191
28. [CHRE 83] P. CHRETIENNE, Les réseaux de Pétri temporisés, Thèse d'état, Université Paris-VI, 1983. 
29. [CHRE 85] P. CHRETIENNE, Analyse des régimes transitoire et permanent d'un graphe d'événements temporisé, TSI, 1985, 4, 1, p. 127-142. Zbl0556.68020
30. [CHRE 89] P. CHRETIENNE, A Polynomial Algorithm to Optimally Schedule Tasks on a Virtual Distributed System Under Tree-Like Precedence Constraints, EJOR, 1989, 43, p. 225-230. Zbl0689.90045MR1033650
31. [CHRE 90 a] P. CHRETIENNE, Task Scheduling with Interprocessor Communication Delays, EJOR, 1992, 57, p. 348-354. Zbl0761.90057
32. [CHRE 90 b] P. CHRETIENNE, Complexity of Tree Scheduling with Interprocessor Communication Delays, Rapport M.A.S.I. n° 90.5, février 1990. Zbl0761.90057
33. [CHRE 91] P. CHRETIENNE, The Basic Cyclic Scheduling Problem with Deadlines, Disc. Appl. Math., 1991, 30, p. 109-123. Zbl0729.90051MR1095366
34. [CHRY 91] G. CHRYSSOLOURIS, K. DICKEet M. LEE, An Approach to Short Interval Scheduling for Discrete Parts Manufacturing, Int. J. Comput. Integrated Manufacturing, 1991, 4, 3, p. 157-168. 
35. [CHU 89] C. CHUet M. C. PORTMANN, Minimisation de la somme des retards pour les problèmes d'ordonnancement à une machine, Rapport de Recherche INRIA n° 1023, avril 1989. 
36. [CHU 90] C. CHU, Nouvelles approches analytiques et concept de mémoire artificielle pour divers problèmes d'ordonnancement, Thèse d'Université, Université de Metz, septembre 1990. 
37. [CHU 92 a] C. CHU, M. C. PORTMANNet J. M. P. PROTH, A Splitting-up Approach to Simplify Job-Shop Scheduling Problems, Int. J. Prod. Res., 1992, 30, 4, p. 859-870. Zbl0729.90973MR1178859
38. [CHU 92 b] C. CHUet M. C. PORTMANN, Some New Efficient Methods to Solve the n/1/ri/Σ Ti Scheduling Problems, EJOR (à paraître). Zbl0760.90055
39. [COFF 76] E. G. COFFMAN Jréd., Computer and Job-Shop Scheduling, J. Wiley & Son, New York, 299 p., 1976. Zbl0359.90031
40. [COHE 85] G. COHEN, D. DUBOIS, J. P. QUADRATet M. VIOT, A Linear System Theoretic View of Discrete Event Processes and its Use for Performance Evaluation in Manufacturing, IEEE. Trans. on Automatic Control, 30, 3, p. 210-220. Zbl0557.93005MR778424
41. [COLI 90] J. Y. COLINet P. CHRETIENNE, C.P.M. Scheduling with Small Interprocessor Communication Times, Opns. Res., 1990. Zbl0793.68012
42. [CONW 67] R. W. CONWAY, W. L. MAXWELLet L. W. MILLER, Theory of Scheduling, Addison-Wesley Publishing Company, 294 p., 1967. Zbl1058.90500MR389180
43. [COUZ 79] C. COUZINET-MERCE, Etude de l'existence de solutions pour certains problèmes d'ordonnancement, Thèse de Docteur-Ingénieur, Université Paul Sabatier, Toulouse, 1979. 
44. [CYTR 84] R. CYTRON, Compile-Time Scheduling and Optimization for Asynchronous Machines, PHD Thesis Univ. of Illinois, Urbana-Champaign, 1984. 
45. [DANN 77] D. G. DANNENBRING, A Evaluation of Flow-Shop Sequencing Heuristics, Management Sci., 1977, 23, 11, p. 1174-1182. Zbl0371.90063
46. [DEME 90] E. DEMEULEMEESTERet W. HERROELEN, A Branch and Bound Procedure for the Multiple Constrained Resource Project Scheduling Problem, EURO WG-PMS, Compiègne, 1990. Zbl0761.90059
47. [DEMP 82] M. A. H. DEMPSTER, J. K. LENSTRAet A. H. G. RINNOOY KAN, Deterministic and Stochastic Scheduling, Reidel Dordrecht, 1982. Zbl0477.00028MR663573
48. [DOGR 79] A. DOGRAMACIet J. SURKIS, Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors, Management Sci., 1979, 25, 12, p. 1208-1216. Zbl0465.90046
49. [DU 90] J. DUet J. Y. T. LEUNG, Minimizing Total Tardiness on One Machine is N.P.-Hard, Math. Opns. Res., 1990, 15, p. 483-495. Zbl0714.90052MR1064213
50. [EISE 88] C. EISENBEIS, Optimization of Horizontal Microcode Generation for Loop Structures, Proc. of the 1988 ACM Int. Conf. on Super-Computing, St Malo, France, juillet 1988, p. 453-465. 
51. [ELMA 92] S. E. ELMAGHRABY, Optimal Time-Cost Trade-off via Dynamic Programming, Project Management and Scheduling 2, EJOR, Special Issue (à paraître). 
52. [ERSC 76 a] J. ERSCHLER, Analyse sous contraintes et aide à la décision pour certains problèmes d'ordonnancement, Thèse d'état, Université Paul-Sabatier, Toulouse, 1976. 
53. [ERSC 76 b] J. ERSCHLER, F. ROUBELLAT et J. P. VERNHES, Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem, Opns. Res., 1976, 24, p. 774-784. Zbl0335.90027MR503689
54. [ERSC 79] J. ERSCHLER, G. FONTAN et F. ROUBELLAT, Potentiels sur un graphe non conjonctif et analyse d'un problème d'ordonnancement à moyens limités, RAIRO-Oper. Res., 1979, 13, 4, p. 363-378. Zbl0424.90033MR553270
55. [ERSC 80] J. ERSCHLER, F. ROUBELLAT et J. P. VERNHES, Characterizing the Set of Feasible Sequences for n Jobs to be Carried out on a Single Machine, EJOR, 1980, 4, p. 189-194. Zbl0425.90053
56. [ERSC 83] J. ERSCHLER, G. FONTAN, C. MERCE et F. ROUBELLAT, A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates, Opns. Res., 1983, 31, 1, p. 114-127. Zbl0495.90046
57. [ERSC 85] J. ERSCHLER, G. FONTAN et C. MERCE, Consistency of the Dissaggregation Process in Hierarchical Planning, Opns. Res., 1985, 34, p. 464-469. Zbl0604.90068
58. [ERSC 91] J. ERSCHLER, P. LOPEZ et C. THURIOT, Raisonnement temporel sous contraintes de ressource et problèmes d'ordonnancement, Revue d'intelligence artificielle, 1991, 5, p, 7-32. 
59. [ESQU 87] P. ESQUIROL, Règles et processus d'inférence pour l'aide à l'ordonnancement de tâches en présence de contraintes, Thèse de Doctorat, Université Paul-Sabatier, Toulouse, 1987. 
60. [FALK 91] E. FALKENAUER et S. BOUFFOUIX, A Genetic Algorithm for Job Shop, Proc. of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, California, avril 1991, p. 824-829. 
61. [FISH 73] M. L. FISHER, Optimal Solution for Scheduling Problems Using Lagrange Multipliers, part 1, Opns. Res., 1973, 21, p. 1114-1127. Zbl0294.90085MR359764
62. [FOLD 92] S. FOLDES et F. SOUMIS, Generalizations of PERT Using the Network Model, Project Management and Scheduling 2, EJOR, Special Issue (à paraître). 
63. [FONT 80] G. FONTAN, Notion de dominance et son application à l'étude de certains problèmes d'ordonnancement, Thèse d'état, Université Paul Sabatier, Toulouse, 1980. 
64. [FREN 82] S. FRENCH, Sequencing and Scheduling: an Introduction to the Mathematics of the Job Shop, Horwood, Chichester, 1982. Zbl0479.90037MR642978
65. [GAO 91] G. R. GAO, Y. B. WONG et QI NING, A Petri Net Model for Fine Grain Loop Scheduling, Proc. of the 91 ACM-SIGPLAN conf. on Prog. Lang. Design. and Impl., Toronto, juin 1991, p. 204-218. 
66. [GARC 85] H. GARCIA et J. M. PROTH, Group Technology in Production Management: the Short Horizon Planning Level, J. Appl. Stoc. Model and Data Analysis, 1985, 1, p, 25-34. Zbl0583.90044
67. [GARC 86] H. GARCIA et J. M. PROTH, A New Cross-Decomposition Algorithm: the GPM. Comparison with the Bond Energy Method, Control and Cybernetics, 1986, 15, 2, p. 155-165. Zbl0611.90063MR880427
68. [GARE 79] M. R. GAREY et D. S. JOHNSON, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979. Zbl0411.68039MR519066
69. [GASP 91] F. GASPERONI et U. SCHWIEGELSOHN, Efficient Algorithms for Cyclic Scheduling, IBM Tech. Rep. RC 17068, août 1991. 
70. [GILM 64] P. C. GILMORE et R. E. GOMORY, Sequencing a One-State Variable Machine: a Solvable Case of the Travelling Salesman Problem, Opns. Res., 1964, 12, p. 655-679. Zbl0126.36006MR171620
71. [GLOV 75] F. GLOVER, Surrogate Constraint Duality in Mathematical Programming, Opns. Res., 1975, 23, p. 434-451. Zbl0314.90093MR459634
72. [GLOV 87] F. GLOVER, Tabu Search Methods in Artificial Intelligence and Operations Research, ORSA, Artificial Intelligence Newletter, 1987, I. 
73. [GOLD 89] D. E. GOLDERG, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989. Zbl0721.68056
74. [GONZ 76] T. GONZALEZ et S. SAHNI, Open-Shop Scheduling to Minimize Finish Time, J.A.C.M., 1976, 23, 4, p. 665-679. Zbl0343.68031MR429089
75. [GONZ 78] T. GONZALEZ et S. SAHNI, Flowshop and Jobshop Schedules: Complexity and Approximation, Opns. Res., 1978, 26, 1, p. 36-52. Zbl0371.90061MR465149
76. [GRAB 82] J. GRABOWSKI, A New Algorithm of Solving the Flow Shop Problem, G. FLEICHTINGER et P. KALL ed., Opns. Res. in Progress, Reidel, Dordrecht, 1982, p. 57-75. Zbl0528.90048MR710494
77. [GRAH 79] R. L. GRAHAM, E. L. LAWLER, J. K. LENSTRA et A. H. G. RINNOOY KAN, Otimisation and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals Disc. Math., 1979, 5, p. 287-326. Zbl0411.90044MR558574
78. [HAN 92] W. HAN, Algorithmes de résolution exacte et heuristique pour les problèmes d'ordonnancement en flowshop, Thèse de Doctorat, Ecole Centrale Paris, France, 156 p., 1992. 
79. [HANE 89] C. HANEN, Microprogramming Using Timed Petri Nets, Advances in Petri Nets, 1989, Springer Verlag. 
80. [HANE 90] C. HANEN, Les tables de réservation numériques : un outil de résolution de certains problèmes d'ordonnancement cycliques, RAIRO-Oper. Res., avril 1990. Zbl0699.90058
81. [HANE 91] C. HANEN, Study of a NP-Hard Scheduling Problem: the Recurrent Job-Shop, EJOR (à paraître). Zbl0801.90061
82. [HANE 92] C. HANEN et A. MUNIER, Cyclic Scheduling on Parallel processors: Problem Structure and Heuristic, Rapport CRI, juin 1992. 
83. [HERZ 90] A. HERTZ et D. DE WERRA, The Tabu Search Metaheuristic: How to Used It, Ann. of Math. and Artificial Intelligence, 1990, 1, p. 111-121. Zbl0878.68053
84. [HHOO 92] H. HOOGEVEN, Single-Machine Bicriteria Scheduling, Doctoral thesis, CWI, Amsterdam, 1992. Zbl0749.90042
85. [HWA 89] J. J. HWANG, Y. C. CHOW, F. O. ANGER et C. H. LEE, Scheduling Precedence Graphs in Systems with Interprocessor Communication Times, SIAM J. Comput., avril 1989, 18, p. 244-257. Zbl0677.68026MR986664
86. [JACK 55] J. R. JACKSON, Scheduling a Production Line to Minimize Maximum Tardiness, Research Report 43, Management Science Research Project, University of California, Los Angeles, 1955. 
87. [JHAV 91] S. C. JHAVERI et B. L. FOOTE, A Heuristic Algorithm to Schedule Work in the Repair Industry, Int. J. Prod. Res., 1991, 29, 12, p. 2393-2405. Zbl0729.90817
88. [JOHN 54] S. M. JOHNSON, Optimal Two- and Three- Stage Production Schedules with Setup Times Included, Nav. Res. Log. Q., 1954, 1, 1, p. 61-68. 
89. [KARP 67] R. M. KARP, R. E. MILLER et S. WINOGRAD, The Organisation of Computations for Uniform Recurrence Equations, J. of the A.C.M., 1967, 14, 3, p. 563-590. Zbl0171.38305MR234604
90. [KIRK 82] S. KIRKPATRICK, C. D. GELATT et M. P. VECCHI, Optimization by Simulated Annealing, Res. Rep. R.C. 9335, IBM Thomas J. Watson, Center Yorktown, NY, 1982. 
91. [KOGG 81] P. M. KOGGE, The Architecture of Pipelined Computers, New York, McGraw Hill, 1981. Zbl0476.68004
92. [KUSI 85 a] A. KUSIAK, A. VANNELLI et K. R. KUMAR, Grouping Problem in Scheduling Flexible Manufacturing Systems, Robotica, 1985, 3, p. 245-252. 
93. [KUSI 85 b] A. KUSIAK, The Part Families Problem in Flexible Manufacturing Systems, Ann. of Opns. Res., 1985, 3, p. 279-300. 
94. [KUSI 86] A. KUSIAK, Efficient Implementation of Johnson's Scheduling Algorithm, IIE Trans., 1986, 18, p. 215-216. 
95. [KUSI 88] A. KUSIAK et M. CHEN, Expert Systems for Planning and Scheduling Manufacturing Systems, EJOR, 1988, 34, p. 113-130. MR935233
96. [LAM 87] M. LAM, A Systolic Array Optimizing Compiler, PhD. Dissertation, Carnegie Mellon University, 1987. 
97. [LAWL 86] E. L. LAWLER, J. K. LENSTRA, A. H. G. RINNOOY KAN et D. B. SHMOYS, The Travelling Salesman Problem, John Wiley, 1986. Zbl0562.00014MR811467
98. [LEGA 89] A. LE GALL, Un système interactif d'aide à la décision pour l'ordonnancement et le pilotage en temps réel d'atelier, Thèse de Doctorat, Université Paul-Sabatier, Toulouse, 1989. 
99. [LEI 89] L. LEI et T. J. WANG, On the Optimal Cyclic Schedules of Single Hoist Electroplating Processes, GSM Working paper n° 89-06, Rutgers University, New-Jersey, 1989. 
100. [LEIS 90] R. LEISTEN, Flowshop Problems with Limited Buffer Storage, Int. J. Prod. Res., 1990, 28, 11, p. 2085-2100. Zbl0707.90054
101. [LENS 77] J. K. LENSTRA, Sequencing by Enumerative Methods, Math. Cent. tracts 69, Centre for Mathematical and Computer Science, Amsterdam, 1977. Zbl0407.90025MR443968
102. [LIN 71] S. LIN et B. W. KERNIGHAN, An Effective Heuristic Algorithm for the Travelling Salesman Problem, Opns. Res., 1971, 21, p. 498-516. Zbl0256.90038MR359742
103. [McMA 71] G. B. MCMAHON, A Study of Algorithms for Industrial Scheduling Problem, Ph. D. Thesis, University of South Wales. 
104. [McMA 92] G. B. MCMAHON, The Two-Machine Maximum Flow-Time Problem with Arbitrary Precedence Relations, EJOR (à paraître). 
105. [MATS 88] H. MATSUO, Cyclic Sequencing Problems in the Two-Machine Permutation Flow Shop: Complexity, Worst Case and Average Case Analysis, Graduate School of Business, University of Texas, Austin, january 1988. Zbl0731.90041
106. [MEGU 88] S. MEGUELATI, Méthodes de classification pour la constitution d'îlots de fabrication et l'ordonnancement, Thèse de Doctorat de l'I.N.S.A., Toulouse, 1985. 
107. [MONM 83] C. L. MONMA et A. H. G. RINNOOY KAN, A Concise Survey of Efficiently Solvable Special Cases of the Permutation Flow-Shop Problem, RAIRO-Oper. Res., 1983, 17, 2, p. 105-109. Zbl0523.90054MR712120
108. [MUNI 91 a] A. MUNIER, Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressource, RAIRO-Oper. Res., 1991, 25, 2, p. 161-182. Zbl0726.90032MR1119964
109. [MUNI 91 b] A. MUNIER, Contribution à l'étude des problèmes d'ordonnancement cycliques, Thèse de l'Université Paris-VI, février 1991. 
110. [MUNS 90] A. MUNSHI et B. SIMONS, Scheduling Loops on Processors: Algorithms and Complexity, SIAM J. of Comput., 1990, 19, p. 728-741. Zbl0697.68028MR1053940
111. [NABE 73] I. NABESHIMA, Algorithms and Reliable Heuristics Programs for MultiProjects Scheduling with Resource Constraints and Related Parallel Scheduling, University of Electrocommunication, Chofu, Tokyo, Japon, 1973. 
112. [NAWA 83] M. NAWAZ, E. ENSCORE et I. HAM, A Heuristic Algorithm for the m Machine, n Job Flowshop Sequence Problem, Omega, 1983, 11, 1, p. 91-95. 
113. [PADB 86] M. PADBERG et G. RINALDI, Optimization of a 532-City Symmetric Travelling Salesman Problem, AFCET, Journées du 20e anniversaire du groupe combinatoire A.F.C.E.T./I.N.R.I.A., décembre 1986. 
114. [PARK 77] R. G. PARKER, R. H. DEANE et R. A. HOLMES, On the Case of a Vehicle Routing Algorithm for the Parallel Processor Problem with Sequence Dependent Changeover Costs, AIIE Trans., 1977, 9, 2, p. 155-160. 
115. [PATE 76] J. H. PATEL et E. S. DAVIDSON, Improving the Throughput of a Pipeline by Insertion of Delays, IEEE 3rd Ann. Symp. on Computers Architecture, january 1976. 
116. [PICO 91] C. PICOULEAU, Two New NP-Complete Scheduling Problems with Communication Delays and Unlimited Number of Processor, Rapport MASI n° 91-24, 1991. 
117. [PINS 88] E. PINSON, Le problème de Job Shop, Thèse de Doctorat de l'Université Paris-VI, 1988. 
118. [PORT 88] M. C. PORTMANN, Méthodes de décomposition spatiales et temporelles en ordonnancement de la production, RAIRO-APII, 1988, 22, 5, p. 439-451. Zbl0647.90046MR966408
119. [POTT 87] C. N. POTTS et L. N. VAN WASSENHOVE, Dynamic Programming and Decomposition Approaches for the Single Machine Total Tardiness Problem, EJOR, 1987, 32, p. 405-414. Zbl0627.90055
120. [PRIN 88] C. PRINS, Problèmes d'optimisation de ressources dans les systèmes de télécommunications par satellite utilisant l'A.M.R.T. (Accès Multiple à Répartition dans le Temps), Thèse de Doctorat de l'Université de Paris-VI, juin 1988. 
121. [PROU 87] C. PROUST, M. DROGOU, J.-M. FOUCHER et E. FOUCHEYRAND, Une heuristique pour le problème d'ordonnancement statique de type n/m/flowshop avec prise en compte des temps de montage et démontage d'outils, 2e Conférence Internationale Systèmes de Production, I.N.R.I.A., Paris, 1987, p. 125-141. Zbl0647.90049
122. [PROU 89] C. PROUST, J.-C. BILLAUT, A. LE SAUX et A.-M. SALAUN, Un logiciel de planification pour outil à deux étages avec changement de fabrication, 1989, Actes du Colloque International « Logistique », A.F.C.E.T., Paris, p. 125-132. 
123. [PROU 91 a] C. PROUST, J. N. D. GUPTA et V. DESCHAMPS, Flowshop Scheduling with Setup, Processing and Removal Times Separated, Int. J. Prod. Res., 1991, 29, 3, p. 479-493. 
124. [PROU 91 b] C. PROUST, A. FERREIRA et J. BIJAOUI, Le paradoxe de l'Interprogrammation : la diversité des logiciels au service d'une intégration efficace, 1991, Actes du 3e Congrès International de Génie Industriel, GGI, Tours, p. 1157-1166. 
125. [PROU 92] C. PROUST, Influence des idées de S. M. Johnson sur la résolution de problèmes d'ordonnancement de type n/m/F, contraintes diverses/Cmax, 1992, Rapport Interne, Laboratoire d'Informatique/E3i, Université de Tours, 150 p. 
126. [QUIN 89] P. QUINTON et Y. ROBERT, Algorithmes et architectures systoliques, Etudes et Recherches en Informatique, Masson, 1989. 
127. [RADH 86] R. RADHARAMAN, A Heuristic Algorithm for Group Scheduling, Proc. of the Int. Industrial Engineering Conference, Institute of Industrial Engineers, 1986, p. 229-236. 
128. [RINN 76] A. H. G. RINNOOY KAN, Machine Sequencing Problems: Classification, Complexity and Computation, Nijhoff, The Hague, 1976. 
129. [ROCK 82] H. ROCK et G. SCHMIDT, Machine Agregation Heuristics in Shop Scheduling, 1982, Bericht 82-11, Fachbereich 20, Mathematich Technische Universitat, Berlin. Zbl0521.90061
130. [ROUN 88] R. ROUNDY, Cyclic Schedules for Job Shops with Identical Jobs, School of Operation Research and Industrial Engineering, Cornell University, T.R. n° 766, juillet 1988. Zbl0770.90036
131. [ROY 70] B. ROY, Algèbre moderne et théorie des graphes, tome 2, Dunod, Paris, 1970. MR260413
132. [SAOU 90] Y. SAOUTER et P. QUINTON, Computability of Recurrence Equations, Rapport de recherche I.N.R.I.A. n° 1203, 1990. Zbl0780.65078
133. [SERA 89] P. SERAFINI et W. UKOVICH, A Mathematical Model for Periodic Scheduling Problems, S.I.A.M. J. of Disc. Math., 1989, 2, 4. Zbl0676.90030MR1018539
134. [SLOW 78] R. SLOWINSKI, Scheduling Preemptable Tasks on Unrelated Processors with Additionnal Ressources to Minimize Schedule Lenght, Lect. Notes on Comput. Sci., Springer-Verlag, 1978, p. 536-547. MR541829
135. [SLOW 82] R. SLOWINSKI, Multiobjective Network Scheduling with Efficient Use of Renewable and Non-Renewable Resources, EJOR, 1982, 7, 3, p. 265-273. Zbl0455.90049MR619616
136. [SLOW 89] R. SLOWINSKI et J. WEGLARZ éd., Advances in Project Scheduling, Elsevier Science, Amsterdam, avril 1989. MR1060130
137. [SMIT 56] W. E. SMITH, Various Optimizers for Single-Stage Production, Nav. Res. Log. Quart., 1956, 3, p. 59-66. MR89109
138. [SRIN 71] V. SRINIVASAN, A Hybrid Algorithm for the One-Machine Sequencing Problem to Minimize Total Tardiness, Nav. Res. Log. Quart., 1971, 18, 3, p. 317-327. Zbl0229.90029MR307683
139. [SUMI 87] R. T. SUMICHRAST et J. R. BAKER, Scheduling Parallel Processors: an Integer Linear Programming Based Heuristic for Minimizing Setup Time, Int. J. Prod. Res., 1987, 25, 5, p. 761-771. Zbl0621.90039
140. [TALB 78] F. B. TALBOT et J. H. PATTERSON, An Efficient Integer Programming with Network Cuts for Solving Resources Constrained Scheduling Problems, Management Sci., 1978, 245, p. 1163-1174. Zbl0395.90036
141. [TAVA 90] L. TAVARES et J. WEGLARZ éd., Project Management and Scheduling, EJOR, Special Issue 1, novembre 1990. 
142. [THOM 80] V. THOMASAide à la décision pour l'ordonnancement d'atelier en temps réel, Thèse de Doctorat, Université Paul-Sabatier, Toulouse, 1980. 
143. [VELD 91] S. L. VAN DE VELDE, Machine Scheduling and Lagrangian Relaxation, Doctoral Thesis, CWI, Amsterdam, 1991. Zbl0728.90046

1. P. Richard, C. Proust, Solving scheduling problems using Petri nets and constraint logic programming
2. C. Caux, G. Fleury, M. Gourgand, P. Kellert, Couplage méthodes d'ordonnancement-simulation pour l'ordonnancement de systèmes industriels de traitement de surface
3. V. Gabrel, Planification à moyen terme de la production d'un satellite défilant et ensembles stables
4. M.-L. Levy, P. Lopez, B. Pradin, Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine
5. Mohamed Haouari, Thouraya Daouas, Optimal scheduling of the $3$-machine assembly-type flow shop
6. A. Vignier, J.-C. Billaut, C. Proust, Les problèmes d'ordonnancement de type «flow-shop» hybride : état de l'art
7. Philippe Baudet, Catherine Azzaro-Pantel, Luc Pibouleau, Serge Domenech, 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