Free Access
| Issue |
RAIRO-Oper. Res.
Volume 12, Number 4, 1978
|
|
|---|---|---|
| Page(s) | 333 - 350 | |
| DOI | https://doi.org/10.1051/ro/1978120403331 | |
| Published online | 06 February 2017 | |
- 1. E. BALAS, Machine sequencing : disjunctive graph and degree constrained subgraphs, IBM. New York Scientific Center Technical Report, n° 320-2971, April 1969. [MR: 272657] [Google Scholar]
- 2. E. BALAS, Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operations Research, 17, n° 6, 1969. [MR: 250770] [Zbl: 0183.49404] [Google Scholar]
- 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: 411599] [Zbl: 0256.90027] [Google Scholar]
- 4. J. CARLIER, Disjonctions dans les ordonnancements. R.A.I.R.O., vol 2, 1975. [EuDML: 104620] [Zbl: 0339.90031] [Google Scholar]
- 5. J. CARLIER, Thèse de troisième cycle, Paris VI, juin 1975. [Google Scholar]
- 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: 304077] [Zbl: 0224.90047] [Google Scholar]
- 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. [Zbl: 0322.90029] [Google Scholar]
- 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: 101165] [Zbl: 0995.90537] [Google Scholar]
- 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: 243934] [Zbl: 0251.90049] [Google Scholar]
- 10. AHG RINNOOY KAN, Machine scheduling problem. Classification complexityand computations, Nijhoff, The Hague, 1976. [Google Scholar]
- 11. B. ROY, Cheminement et connexité dans les graphes ; applications aux problèmes d'ordonnancement. METRA, série spéciale, n° 1, 1962. [Google Scholar]
- 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. [Google Scholar]
- 13. B. ROY, Algèbre moderne et théorie des graphes. Tome II, Dunod, 1970. [Zbl: 0238.90073] [MR: 260413] [Google Scholar]
- 14. Y. TABOURIER, Problèmes d'ordonnancement à contraintes purement disjonctives. R.A.I.R.O., Série verte, n° 3, 1969. [EuDML: 104479] [Google Scholar]
- 15. J. F. MUTH and G. L. THOMPSON, Industrial Scheduling, Englewoods Cliffs New Jersey, Prentice Hall. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.