Ordonnancements à contraintes disjonctives
RAIRO - Operations Research - Recherche Opérationnelle, Volume 12 (1978) no. 4, pp. 333-350.
@article{RO_1978__12_4_333_0,
     author = {Carlier, Jacques},
     title = {Ordonnancements \`a contraintes disjonctives},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {333--350},
     publisher = {EDP-Sciences},
     volume = {12},
     number = {4},
     year = {1978},
     mrnumber = {516514},
     zbl = {0401.90052},
     language = {fr},
     url = {http://archive.numdam.org/item/RO_1978__12_4_333_0/}
}
TY  - JOUR
AU  - Carlier, Jacques
TI  - Ordonnancements à contraintes disjonctives
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1978
SP  - 333
EP  - 350
VL  - 12
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1978__12_4_333_0/
LA  - fr
ID  - RO_1978__12_4_333_0
ER  - 
%0 Journal Article
%A Carlier, Jacques
%T Ordonnancements à contraintes disjonctives
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1978
%P 333-350
%V 12
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1978__12_4_333_0/
%G fr
%F RO_1978__12_4_333_0
Carlier, Jacques. Ordonnancements à contraintes disjonctives. RAIRO - Operations Research - Recherche Opérationnelle, Volume 12 (1978) no. 4, pp. 333-350. http://archive.numdam.org/item/RO_1978__12_4_333_0/

1. E. Balas, Machine sequencing : disjunctive graph and degree constrained subgraphs, IBM. New York Scientific Center Technical Report, n° 320-2971, April 1969. | MR

2. E. Balas, Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operations Research, 17, n° 6, 1969. | MR | Zbl

3. P. Bratley, M. Florian and P. Robillard, On sequencing with earliest start and due dates with application to Computing bounds for the (n, m, G/Fmax), Problem. N.L.R.Q., 20, 57, 1973. | MR | Zbl

4. J. Carlier, Disjonctions dans les ordonnancements. R.A.I.R.O., vol 2, 1975. | Numdam | Zbl

5. J. Carlier, Thèse de troisième cycle, Paris VI, juin 1975.

6. M. Florian, P. Trepant and G. Mc-Mahon, An implicit enumeration algorithm for the machine sequencing problems. Management Science, 17, 782; August 1971. | MR | Zbl

7. M. Florian, C. Tilquin and G. Tilquin, An implicit enumeration algorithm for complex scheduling problems. International Journal of Production Research 13, 1975, 1 (Jan), p. 25-40.

8. S.-B. Johnson, Discussion : sequencing n jobs on two machines with arbitrary time lags. Management Science, vol. 5, n° 3, 1960, p. 299. | MR | Zbl

9. J.-F. Raimond, Minimaximal paths on disjunctive graphs by direct search. IBM Journal of research and development, vol. 13, n° 4, July 1969. | MR | Zbl

10. Ahg Rinnooy Kan, Machine scheduling problem. Classification complexityand computations, Nijhoff, The Hague, 1976.

11. B. Roy, Cheminement et connexité dans les graphes ; applications aux problèmes d'ordonnancement. METRA, série spéciale, n° 1, 1962.

12. B. Roy, Prise en compte des contraintes disjonctives dans la méthode du chemin critique. R.A.I.R.O., n° 38, 1966, p. 68-84.

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

14. Y. Tabourier, Problèmes d'ordonnancement à contraintes purement disjonctives. R.A.I.R.O., Série verte, n° 3, 1969.

15. J. F. Muth and G. L. Thompson, Industrial Scheduling, Englewoods Cliffs New Jersey, Prentice Hall.