Un domaine très ouvert : les problèmes d'ordonnancement
RAIRO - Operations Research - Recherche Opérationnelle, Tome 16 (1982) no. 3, pp. 175-217. 
@article{RO_1982__16_3_175_0,
     author = {Carlier, J. and Chr\'etienne, P.},
     title = {Un domaine tr\`es ouvert : les probl\`emes d'ordonnancement},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {175--217},
     publisher = {EDP-Sciences},
     volume = {16},
     number = {3},
     year = {1982},
     zbl = {0494.90040},
     language = {fr},
     url = {http://www.numdam.org/item/RO_1982__16_3_175_0/}
}
TY  - JOUR
AU  - Carlier, J.
AU  - Chrétienne, P.
TI  - Un domaine très ouvert : les problèmes d'ordonnancement
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1982
SP  - 175
EP  - 217
VL  - 16
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_1982__16_3_175_0/
LA  - fr
ID  - RO_1982__16_3_175_0
ER  - 
%0 Journal Article
%A Carlier, J.
%A Chrétienne, P.
%T Un domaine très ouvert : les problèmes d'ordonnancement
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1982
%P 175-217
%V 16
%N 3
%I EDP-Sciences
%U http://www.numdam.org/item/RO_1982__16_3_175_0/
%G fr
%F RO_1982__16_3_175_0
Carlier, J.; Chrétienne, P. Un domaine très ouvert : les problèmes d'ordonnancement. RAIRO - Operations Research - Recherche Opérationnelle, Tome 16 (1982) no. 3, pp. 175-217. http://www.numdam.org/item/RO_1982__16_3_175_0/

1. E. Balas, Machine Sequencing via Disjunctive Graph : an Implicit Enumeration algorithm, Operation Research, vol. 17, n° 6, 1969. | MR | Zbl

2. K. A. Baker, Introduction to Sequencing and Scheduling, John Wiley and sons, 1974.

3. K. A. Baker et Z. S. Su, Sequencing with Due-Dates and Early Start-Times to Minimize Maximum Tardiness, Naval Research Logistic Quarterly, vol. 21, mars 1974, p. 171-176. | MR | Zbl

4. P. Bratley, M. Florian et P. Robillard, On Sequencing with Earliest Start and Due-dates with Applications to Calculations of Bounds for the (n, m, G/Fmax) Problem, Naval Research Logistic Quarterly, 1979, p. 20-57. | MR | Zbl

5. J. Bruno, E. G. Coffman et R. Sethi, Algorithms for Minimizing Mean Flow Time, Proceedings, IFIPS Congress, North Holland Publishing Company août 1974, p. 504-510. | MR | Zbl

6. J. Bruno et R. Sethi, On the Complexity of Mean Flow Time Scheduling, Technical Report, Computer Science Dept, Pennsylvania State University, 1975. | Zbl

7. J. Bruno, E. G. Coffman et R. Sethi, Scheduling Independant Tasks to Reduce Mean Finishing Time, Communications of the A.C.M., vol. 17, n° 7, 1974. | MR | Zbl

8. J. Carlier, Ordonnancements à contraintes disjonctives, R.A.I.R.O., vol. 12, n° 4, novembre 1978. | Numdam | MR | Zbl

9. J. Carlier, Financement et ordonnancements, Rapport de recherche, IP n° 78-8, Paris-VI, 1978.

10. J. Carlier, Problème à une machine, EURO-IV, Cambridge, 1980; Rapport IP n° 80-3, Paris-VI.

11. E. G. Coffman et R. L. Graham, Optimal Scheduling for two Processor systems, Acta Informatica, vol. 1, n° 3, 1972, p. 200-213. | MR | Zbl

12. E. G. Coffman, Computer and Job-Shop Scheduling Theory, John Wiley and Sons, 1976. | MR | Zbl

13. R. W. Conway, W. L. Maxwell et L. W. Miller, Theory of Scheduling, Addison Wesley, Reading, Mass., 1967. | MR | Zbl

14. J. Erschler, G. Fontan et F. Roubellat, Potentiels sur un graphe non conjonctif et analyse d'un problème d'ordonnancement à moyens limités, R.A.I.R.O., vol. V-13, n° 4, 1979, p. 363. | Numdam | MR | Zbl

15. R. Faure, C. Roucairol et P. Tolla, Chemins, Flots et ordonnancements, Gauthier-Villars, 1976. | MR

16. M. R. Garey et D. S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, California, 1978. | MR | Zbl

17. M. R. Garey, D. S. Johnson et R. Sethi, The Complexity of Flow-Shop and Job-shop Scheduling, Technical Report, n° 168, Computer Science Dept, Pennsylvania State University, 1975. | Zbl

18. R. L. Graham, Bounds for Certain Multiprocessing Anomalies, Bell Systems Technical Journal, vol. 45, 1966, p. 1563-1581. | Zbl

19. R. L. Graham, Bounds for Certain Timing Anomalies, S.I.A.M. Journal on Applied Mathematics, vol. 17, n° 2, 1969, p. 416-419.

20. R. L. Graham, E. L. Lawler, J. K. Lenstra et A. H. G. Rinnoy Kan, Optimization and Approximation in Deterministic Sequencing, Proceedings of DO 77, Vancouver. | Zbl

21. W. A. Horn, Single Machine Job Sequencing with Tree-Like Precedence Ordering and Linear Delay Penalties, S.I.A.M. Journal on Applied Mathematics, vol. 23, 1972, p. 189-202. | MR | Zbl

22. T. C. Hu, Parallel Sequencing and Assembly Line Problems, Operations Research, vol. 9, n° 6, 1961, p. 841-848. | MR

23. S. M. Johnson, Optimal Two and Three Stage Production Schedules, Naval Research Logistic Quarterly, vol. 1, n° 1, 1954.

24. M. T. Kaufman, An almost Optimal Algorithm for the Assembly Line Scheduling Problem, I.E.E.E. Transactions on Computers, vol. TC-74, 1974, p. 1169-1174. | MR | Zbl

25. A. Kaufman et G. Desbazeille, La méthode du chemin critique, Dunod, Paris, 1966. | Zbl

26. J. Labetoulle et E. L. Lawler, On Preemptive Scheduling of Unrelated Parallel Processors, J.A.C.M. (à paraître). | Zbl

27. J. Labetoulle, E. L. Lawler et A. H. G. Rinnoy Kan, Preemptive Scheduling of Uniform Machines Subject to Release dates (à paraître). | Zbl

28. E. L. Lawler et J. M. Moore, A Functional Equation and its Application to Resource Allocation and Sequencing Problems, Management Science, vol. 16, n° 1, septembre 1969, p. 77-84. | Zbl

29. B. J. Lageweg, J. K. Lestra et A. H. G. Rinnoy Kan, Minimizing Maximum Lateness on one Machine: Computational Experience and some Applications, Statistica Neerlandica, vol. 30, 1976, p. 25-41. | MR | Zbl

30. J. K. Lenstra Sequencing by Enumerative Methods, Mathematical Centre Tract, 69, Mathematical Centrum, Amsterdam, 1977. | MR | Zbl

31. S. Lin, Computer Solutions to the Traveling Salesman Problem, Bell Systems Technical Journal, vol. 44, n° 10, 1965, p. 2245-2269. | MR | Zbl

32. R. R. Muntz et E. G. Coffman, Preemptive Scheduling of Real Time Tasks on Multiprocessor Systems, Journal de l'A.C.M., vol. 17, n° 2, 1970, p. 324-338. | MR | Zbl

33. R. R. Muntz et E. G. Coffman, Optimal Preemptive Scheduling on Processor Systems, I.E.E.E. Transactions on Computers, vol. C-18, n° 11, 1969, p. 1014-1020. | Zbl

34. Nepomiastchy, Résolution d'un problème d'ordonnancement à ressources variables, R.A.I.R.O., vol. V-12, n° 3, août 1978. | Numdam | Zbl

35. A. H. G. Rinnoy-Kan, Machine Scheduling Problem: Classification, Complexity and Computations, Nyhoff, The Hague, 1976. | Zbl

36. B. Roy, Algèbre moderne et théorie des graphes, Tome II, Paris, Dunod, 1970. | MR

37. B. Roy, Cheminements et connexité dans les graphes, applications aux problèmes d'ordonnancement, revue METRA, vol. 62, série spéciale, n° 1, 1962.

38. B. Roy et M. C. Portmann, Les problèmes d'ordonnancement, applications et méthodes, Cahier du LAMSADE, Université Paris-9, 1979.

39. S. K. Sahni, Algorithms for Scheduling Independant Tasks, Journal de l'A.C.M., vol. 23, n° 1, janvier 1976, p. 116-127. | MR | Zbl

40. L. Schrage, Solving Resource-Constrained Network Problems by Implicit Enumeration: Preemptive Case, Operations Research, vol. 20, n° 3, 1972, p. 668-677. | Zbl

41. R. Slowinsky, Multiobjective Network Scheduling with Efficient Use of Renewable and Non-Renewable Resources, European Journal of Operational Research, vol. 5, 1980. | Zbl

42. J. D. Ullman, Polynomial Complete Scheduling Problems, Operating Systems Review, vol. 7, n° 4, 1973, p. 96-101. | Zbl

43. H. Wagner, Principles of Operations Research with Applications to Managerial Decisions, p. 185-187, Prentice-Hall, 1969. | MR | Zbl

44. J. Weglarz, Project Scheduling with Continously Divisible, Doubly Constrained Resources, Management Science, 1981, (à paraître). | Zbl

45. B. Simmons, A Fast Algorithm for Simple Processor Scheduling, 19th annual symposium on Fondations of Computer Science, octobre 1978, p. 246-251.