@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 -
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. Machine Sequencing via Disjunctive Graph : an Implicit Enumeration algorithm, Operation Research, vol. 17, n° 6, 1969. | MR | Zbl
,2. Introduction to Sequencing and Scheduling, John Wiley and sons, 1974.
,3. 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
et ,4. 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
, et ,5. Algorithms for Minimizing Mean Flow Time, Proceedings, IFIPS Congress, North Holland Publishing Company août 1974, p. 504-510. | MR | Zbl
, et ,6. On the Complexity of Mean Flow Time Scheduling, Technical Report, Computer Science Dept, Pennsylvania State University, 1975. | Zbl
et ,7. Scheduling Independant Tasks to Reduce Mean Finishing Time, Communications of the A.C.M., vol. 17, n° 7, 1974. | MR | Zbl
, et ,8. Ordonnancements à contraintes disjonctives, R.A.I.R.O., vol. 12, n° 4, novembre 1978. | Numdam | MR | Zbl
,9. Financement et ordonnancements, Rapport de recherche, IP n° 78-8, Paris-VI, 1978.
,10. Problème à une machine, EURO-IV, Cambridge, 1980; Rapport IP n° 80-3, Paris-VI.
,11. Optimal Scheduling for two Processor systems, Acta Informatica, vol. 1, n° 3, 1972, p. 200-213. | MR | Zbl
et ,12. Computer and Job-Shop Scheduling Theory, John Wiley and Sons, 1976. | MR | Zbl
,13. Theory of Scheduling, Addison Wesley, Reading, Mass., 1967. | MR | Zbl
, et ,14. 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
, et ,15. Chemins, Flots et ordonnancements, Gauthier-Villars, 1976. | MR
, et ,16. Computers and Intractability: a Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, California, 1978. | MR | Zbl
et ,17. The Complexity of Flow-Shop and Job-shop Scheduling, Technical Report, n° 168, Computer Science Dept, Pennsylvania State University, 1975. | Zbl
, et ,18. Bounds for Certain Multiprocessing Anomalies, Bell Systems Technical Journal, vol. 45, 1966, p. 1563-1581. | Zbl
,19. Bounds for Certain Timing Anomalies, S.I.A.M. Journal on Applied Mathematics, vol. 17, n° 2, 1969, p. 416-419.
,20. Optimization and Approximation in Deterministic Sequencing, Proceedings of DO 77, Vancouver. | Zbl
, , et ,21. 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. Parallel Sequencing and Assembly Line Problems, Operations Research, vol. 9, n° 6, 1961, p. 841-848. | MR
,23. Optimal Two and Three Stage Production Schedules, Naval Research Logistic Quarterly, vol. 1, n° 1, 1954.
,24. 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. La méthode du chemin critique, Dunod, Paris, 1966. | Zbl
et ,26. On Preemptive Scheduling of Unrelated Parallel Processors, J.A.C.M. (à paraître). | Zbl
et ,27. Preemptive Scheduling of Uniform Machines Subject to Release dates (à paraître). | Zbl
, et ,28. A Functional Equation and its Application to Resource Allocation and Sequencing Problems, Management Science, vol. 16, n° 1, septembre 1969, p. 77-84. | Zbl
et ,29. Minimizing Maximum Lateness on one Machine: Computational Experience and some Applications, Statistica Neerlandica, vol. 30, 1976, p. 25-41. | MR | Zbl
, et ,30. Sequencing by Enumerative Methods, Mathematical Centre Tract, 69, Mathematical Centrum, Amsterdam, 1977. | MR | Zbl
31. Computer Solutions to the Traveling Salesman Problem, Bell Systems Technical Journal, vol. 44, n° 10, 1965, p. 2245-2269. | MR | Zbl
,32. 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
et ,33. Optimal Preemptive Scheduling on Processor Systems, I.E.E.E. Transactions on Computers, vol. C-18, n° 11, 1969, p. 1014-1020. | Zbl
et ,34. 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. Machine Scheduling Problem: Classification, Complexity and Computations, Nyhoff, The Hague, 1976. | Zbl
,36. Algèbre moderne et théorie des graphes, Tome II, Paris, Dunod, 1970. | MR
,37. Cheminements et connexité dans les graphes, applications aux problèmes d'ordonnancement, revue METRA, vol. 62, série spéciale, n° 1, 1962.
,38. Les problèmes d'ordonnancement, applications et méthodes, Cahier du LAMSADE, Université Paris-9, 1979.
et ,39. Algorithms for Scheduling Independant Tasks, Journal de l'A.C.M., vol. 23, n° 1, janvier 1976, p. 116-127. | MR | Zbl
,40. Solving Resource-Constrained Network Problems by Implicit Enumeration: Preemptive Case, Operations Research, vol. 20, n° 3, 1972, p. 668-677. | Zbl
,41. Multiobjective Network Scheduling with Efficient Use of Renewable and Non-Renewable Resources, European Journal of Operational Research, vol. 5, 1980. | Zbl
,42. Polynomial Complete Scheduling Problems, Operating Systems Review, vol. 7, n° 4, 1973, p. 96-101. | Zbl
,43. Principles of Operations Research with Applications to Managerial Decisions, p. 185-187, Prentice-Hall, 1969. | MR | Zbl
,44. Project Scheduling with Continously Divisible, Doubly Constrained Resources, Management Science, 1981, (à paraître). | Zbl
,45. A Fast Algorithm for Simple Processor Scheduling, 19th annual symposium on Fondations of Computer Science, octobre 1978, p. 246-251.
,