Free Access
Issue
RAIRO-Oper. Res.
Volume 16, Number 3, 1982
Page(s) 219 - 239
DOI https://doi.org/10.1051/ro/1982160302191
Published online 06 February 2017
  • 1. ASHOUR, Sequencing Theory, Springer Verlag, 1972. [MR: 363453] [Zbl: 0241.90029]
  • 2. BALAS, Machine Sequencing via Disjunctive Graphs: an Implicit Enumeration Algorithm, Operations Research, n° 6, 1969. [Zbl: 0202.18503]
  • 3. CARLIER, Ordonnancement à contraintes disjonctives, R.A.I.R.O., novembre 1978. [EuDML: 104705] [Zbl: 0401.90052]
  • 4. CONWAY/MAXWELL Theory of Scheduling, Addison Wesley, 1967. [Zbl: 1058.90500]
  • 5. ELMAGHRABY, The Machine Sequencing Pb, Reviews and Extensions, N.R.L.Q., n° 2, 1968.
  • 6. FLORIAN/BRATLEY/ROBILLARD, On Sequencing with Earliest Starts and Due-Dateswith Applications to Computing Bounds for the n/m/G/Fmax Problems, N.R.L.Q., vol. 20, 1973. [Zbl: 0256.90027]
  • 7. IGNALL/SCHRAGE, Application to the Branch and Bound Technique to Some Flow-Shop Scheduling Problems, Operations Research, mai-juin 1965.
  • 8. JACKSON, Some Problems in Queuing with Dynamic Properties, N.R.L.Q., n° 3, 1960. [Zbl: 0115.36101]
  • 9. LITTLE, A Proof for the Queuing Formula L = ?W, Operations Research, n° 3, mai 1961. [MR: 125644] [Zbl: 0108.14803]
  • 10. MINOUX, Algorithmes Gloutons, E.D.F. Bulletin, 1977.
  • 11. NEPOMIASTCHY, Résolution d'un problème d'ordonnancement à ressources variables, R.A.I.R.O., août 1978. [EuDML: 104694] [Zbl: 0383.60108]
  • 12. SOUBRIER, Un modèle de résolution de problèmes d'ordonnancement dynamique, Thèse de Docteur-Ingénieur, U.P.S., Toulouse, 1981.

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.