no. 1
Les problèmes d'ordonnancement
RAIRO - Operations Research - Recherche Opérationnelle, Tome 27 (1993) no. 1, pp. 77-150. 
@article{RO_1993__27_1_77_0,
     author = {Gotha},
     title = {Les probl\`emes d'ordonnancement},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {77--150},
     publisher = {EDP-Sciences},
     volume = {27},
     number = {1},
     year = {1993},
     mrnumber = {1209112},
     language = {fr},
     url = {http://www.numdam.org/item/RO_1993__27_1_77_0/}
}
TY  - JOUR
AU  - Gotha
TI  - Les problèmes d'ordonnancement
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1993
SP  - 77
EP  - 150
VL  - 27
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_1993__27_1_77_0/
LA  - fr
ID  - RO_1993__27_1_77_0
ER  - 
%0 Journal Article
%A Gotha
%T Les problèmes d'ordonnancement
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1993
%P 77-150
%V 27
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/RO_1993__27_1_77_0/
%G fr
%F RO_1993__27_1_77_0
Gotha. Les problèmes d'ordonnancement. RAIRO - Operations Research - Recherche Opérationnelle, Tome 27 (1993) no. 1, pp. 77-150. http://www.numdam.org/item/RO_1993__27_1_77_0/

[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. | MR | Zbl

[ADAM 88] J. Adams, E. Balaset D. Zawack, The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Sci., 1988, 34, p. 391-401. | MR | Zbl

[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.

[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.

[AXSA 84] S. Axsateret H. Jonsson, Aggregation and Dissaggregation in Hierarchical Production Planning, EJOR, 1984, 17, p. 338-350. | MR

[BAKE 74] K. R. Baker, Introduction to Sequencing and Scheduling, John Wiley, 1974.

[BAKE 90] K. R. Baker, Scheduling Groups of Jobs in the Two-Machine Flow Shop, Math. Comput. Modelling, 1990, 13, 3, p. 29-36. | MR

[BELL 82] R. Bellman, A. O. Esogbueet I. Nabeshima, Mathematical Aspects of Scheduling and Applications, Pergamon Press, Oxford, England, 1982. | MR | Zbl

[BIEG 90] J. E. Biegelet J. J. Davern, Genetic Algorithms and Job Shop Scheduling, Comput. ind. Engng., 1990, 19, 1/4, p. 81-91.

[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. | Zbl

[BRUC 91] P. Brucker, B. Jurishet B. Sievers, A Branch and Bound Algorithm for the Job Shop Scheduling Problem, Disc. Appl. Math. (à paraître). | Zbl

[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. | MR | Zbl

[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. | Zbl

[CARL 75] J. Carlier, Disjonctions dans les ordonnancements, RAIRO-Oper. Res., juin 1975, 2, p. 83-100. | Numdam | Zbl

[CARL 78] J. Carlier, Ordonnancements à Contraintes Disjonctives, RAIRO-Oper. Res., novembre 1978, 12, p. 333-351. | Numdam | MR | Zbl

[CARL 82 a] J. Carlieret A. H. G. Rinnooy Kan, Financing and Scheduling, Opns. Res. Letters, avril 1982, 1, 2, p. 52-55. | Zbl

[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. | Numdam | Zbl

[CARL 82 c] J. Carlier, The One Machine Problem, EJOR, 1982, p. 42-47. | Zbl

[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. | MR | Zbl

[CARL 88 a] J. Carlieret P. Chretienne, Les problèmes d'ordonnancements : modélisation, complexité, algorithmes, Masson, Paris, février 1988.

[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.

[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. | MR | Zbl

[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. | MR | Zbl

[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. | MR

[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). | Zbl

[CARL 92] J. Carlieret L. Tavares éd., Project Management and Scheduling 2, EJOR, Special Issue (à paraître).

[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. | MR | Zbl

[CHRE 83] P. Chretienne, Les réseaux de Pétri temporisés, Thèse d'état, Université Paris-VI, 1983.

[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. | Zbl

[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. | MR | Zbl

[CHRE 90 a] P. Chretienne, Task Scheduling with Interprocessor Communication Delays, EJOR, 1992, 57, p. 348-354. | Zbl

[CHRE 90 b] P. Chretienne, Complexity of Tree Scheduling with Interprocessor Communication Delays, Rapport M.A.S.I. n° 90.5, février 1990. | Zbl

[CHRE 91] P. Chretienne, The Basic Cyclic Scheduling Problem with Deadlines, Disc. Appl. Math., 1991, 30, p. 109-123. | MR | Zbl

[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.

[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.

[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.

[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. | MR | Zbl

[CHU 92 b] C. Chuet M. C. Portmann, Some New Efficient Methods to Solve the n/1/ri/Σ Ti Scheduling Problems, EJOR (à paraître). | Zbl

[COFF 76] E. G. Coffman Jréd., Computer and Job-Shop Scheduling, J. Wiley & Son, New York, 299 p., 1976. | Zbl

[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. | MR | Zbl

[COLI 90] J. Y. Colinet P. Chretienne, C.P.M. Scheduling with Small Interprocessor Communication Times, Opns. Res., 1990. | Zbl

[CONW 67] R. W. Conway, W. L. Maxwellet L. W. Miller, Theory of Scheduling, Addison-Wesley Publishing Company, 294 p., 1967. | MR | Zbl

[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.

[CYTR 84] R. Cytron, Compile-Time Scheduling and Optimization for Asynchronous Machines, PHD Thesis Univ. of Illinois, Urbana-Champaign, 1984.

[DANN 77] D. G. Dannenbring, A Evaluation of Flow-Shop Sequencing Heuristics, Management Sci., 1977, 23, 11, p. 1174-1182. | Zbl

[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. | Zbl

[DEMP 82] M. A. H. Dempster, J. K. Lenstraet A. H. G. Rinnooy Kan, Deterministic and Stochastic Scheduling, Reidel Dordrecht, 1982. | MR | Zbl

[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. | Zbl

[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. | MR | Zbl

[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.

[ELMA 92] S. E. Elmaghraby, Optimal Time-Cost Trade-off via Dynamic Programming, Project Management and Scheduling 2, EJOR, Special Issue (à paraître).

[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.

[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. | MR | Zbl

[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. | Numdam | MR | Zbl

[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. | Zbl

[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. | Zbl

[ERSC 85] J. Erschler, G. Fontan et C. Merce, Consistency of the Dissaggregation Process in Hierarchical Planning, Opns. Res., 1985, 34, p. 464-469. | Zbl

[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.

[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.

[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.

[FISH 73] M. L. Fisher, Optimal Solution for Scheduling Problems Using Lagrange Multipliers, part 1, Opns. Res., 1973, 21, p. 1114-1127. | MR | Zbl

[FOLD 92] S. Foldes et F. Soumis, Generalizations of PERT Using the Network Model, Project Management and Scheduling 2, EJOR, Special Issue (à paraître).

[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.

[FREN 82] S. French, Sequencing and Scheduling: an Introduction to the Mathematics of the Job Shop, Horwood, Chichester, 1982. | MR | Zbl

[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.

[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. | Zbl

[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. | MR | Zbl

[GARE 79] M. R. Garey et D. S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979. | MR | Zbl

[GASP 91] F. Gasperoni et U. Schwiegelsohn, Efficient Algorithms for Cyclic Scheduling, IBM Tech. Rep. RC 17068, août 1991.

[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. | MR | Zbl

[GLOV 75] F. Glover, Surrogate Constraint Duality in Mathematical Programming, Opns. Res., 1975, 23, p. 434-451. | MR | Zbl

[GLOV 87] F. Glover, Tabu Search Methods in Artificial Intelligence and Operations Research, ORSA, Artificial Intelligence Newletter, 1987, I.

[GOLD 89] D. E. Golderg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989. | Zbl

[GONZ 76] T. Gonzalez et S. Sahni, Open-Shop Scheduling to Minimize Finish Time, J.A.C.M., 1976, 23, 4, p. 665-679. | MR | Zbl

[GONZ 78] T. Gonzalez et S. Sahni, Flowshop and Jobshop Schedules: Complexity and Approximation, Opns. Res., 1978, 26, 1, p. 36-52. | MR | Zbl

[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. | MR | Zbl

[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. | MR | Zbl

[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.

[HANE 89] C. Hanen, Microprogramming Using Timed Petri Nets, Advances in Petri Nets, 1989, Springer Verlag.

[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. | Numdam | Zbl

[HANE 91] C. Hanen, Study of a NP-Hard Scheduling Problem: the Recurrent Job-Shop, EJOR (à paraître). | Zbl

[HANE 92] C. Hanen et A. Munier, Cyclic Scheduling on Parallel processors: Problem Structure and Heuristic, Rapport CRI, juin 1992.

[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. | Zbl

[HHOO 92] H. Hoogeven, Single-Machine Bicriteria Scheduling, Doctoral thesis, CWI, Amsterdam, 1992. | Zbl

[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. | MR | Zbl

[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.

[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. | Zbl

[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.

[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. | MR | Zbl

[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.

[KOGG 81] P. M. Kogge, The Architecture of Pipelined Computers, New York, McGraw Hill, 1981. | Zbl

[KUSI 85 a] A. Kusiak, A. Vannelli et K. R. Kumar, Grouping Problem in Scheduling Flexible Manufacturing Systems, Robotica, 1985, 3, p. 245-252.

[KUSI 85 b] A. Kusiak, The Part Families Problem in Flexible Manufacturing Systems, Ann. of Opns. Res., 1985, 3, p. 279-300.

[KUSI 86] A. Kusiak, Efficient Implementation of Johnson's Scheduling Algorithm, IIE Trans., 1986, 18, p. 215-216.

[KUSI 88] A. Kusiak et M. Chen, Expert Systems for Planning and Scheduling Manufacturing Systems, EJOR, 1988, 34, p. 113-130. | MR

[LAM 87] M. Lam, A Systolic Array Optimizing Compiler, PhD. Dissertation, Carnegie Mellon University, 1987.

[LAWL 86] E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan et D. B. Shmoys, The Travelling Salesman Problem, John Wiley, 1986. | MR | Zbl

[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.

[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.

[LEIS 90] R. Leisten, Flowshop Problems with Limited Buffer Storage, Int. J. Prod. Res., 1990, 28, 11, p. 2085-2100. | Zbl

[LENS 77] J. K. Lenstra, Sequencing by Enumerative Methods, Math. Cent. tracts 69, Centre for Mathematical and Computer Science, Amsterdam, 1977. | MR | Zbl

[LIN 71] S. Lin et B. W. Kernighan, An Effective Heuristic Algorithm for the Travelling Salesman Problem, Opns. Res., 1971, 21, p. 498-516. | MR | Zbl

[McMA 71] G. B. Mcmahon, A Study of Algorithms for Industrial Scheduling Problem, Ph. D. Thesis, University of South Wales.

[McMA 92] G. B. Mcmahon, The Two-Machine Maximum Flow-Time Problem with Arbitrary Precedence Relations, EJOR (à paraître).

[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. | Zbl

[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.

[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. | Numdam | MR | Zbl

[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. | Numdam | MR | Zbl

[MUNI 91 b] A. Munier, Contribution à l'étude des problèmes d'ordonnancement cycliques, Thèse de l'Université Paris-VI, février 1991.

[MUNS 90] A. Munshi et B. Simons, Scheduling Loops on Processors: Algorithms and Complexity, SIAM J. of Comput., 1990, 19, p. 728-741. | MR | Zbl

[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.

[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.

[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.

[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.

[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.

[PICO 91] C. Picouleau, Two New NP-Complete Scheduling Problems with Communication Delays and Unlimited Number of Processor, Rapport MASI n° 91-24, 1991.

[PINS 88] E. Pinson, Le problème de Job Shop, Thèse de Doctorat de l'Université Paris-VI, 1988.

[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. | MR | Zbl

[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. | Zbl

[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.

[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. | Zbl

[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.

[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.

[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.

[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.

[QUIN 89] P. Quinton et Y. Robert, Algorithmes et architectures systoliques, Etudes et Recherches en Informatique, Masson, 1989.

[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.

[RINN 76] A. H. G. Rinnooy Kan, Machine Sequencing Problems: Classification, Complexity and Computation, Nijhoff, The Hague, 1976.

[ROCK 82] H. Rock et G. Schmidt, Machine Agregation Heuristics in Shop Scheduling, 1982, Bericht 82-11, Fachbereich 20, Mathematich Technische Universitat, Berlin. | Zbl

[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. | Zbl

[ROY 70] B. Roy, Algèbre moderne et théorie des graphes, tome 2, Dunod, Paris, 1970. | MR

[SAOU 90] Y. Saouter et P. Quinton, Computability of Recurrence Equations, Rapport de recherche I.N.R.I.A. n° 1203, 1990. | Zbl

[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. | MR | Zbl

[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. | MR

[SLOW 82] R. Slowinski, Multiobjective Network Scheduling with Efficient Use of Renewable and Non-Renewable Resources, EJOR, 1982, 7, 3, p. 265-273. | MR | Zbl

[SLOW 89] R. Slowinski et J. Weglarz éd., Advances in Project Scheduling, Elsevier Science, Amsterdam, avril 1989. | MR

[SMIT 56] W. E. Smith, Various Optimizers for Single-Stage Production, Nav. Res. Log. Quart., 1956, 3, p. 59-66. | MR

[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. | MR | Zbl

[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. | Zbl

[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. | Zbl

[TAVA 90] L. Tavares et J. Weglarz éd., Project Management and Scheduling, EJOR, Special Issue 1, novembre 1990.

[THOM 80] V. Thomas Aide à la décision pour l'ordonnancement d'atelier en temps réel, Thèse de Doctorat, Université Paul-Sabatier, Toulouse, 1980.

[VELD 91] S. L. Van De Velde, Machine Scheduling and Lagrangian Relaxation, Doctoral Thesis, CWI, Amsterdam, 1991.