Free Access
Issue
RAIRO-Oper. Res.
Volume 25, Number 3, 1991
Page(s) 311 - 340
DOI https://doi.org/10.1051/ro/1991250303111
Published online 06 February 2017
  • [ALVAREZ 88] R. ALVAREZ-VALDES and J. M. TAMARIT, Computational Comparison of Classical and new Heuristic Algorithms for Resource-constrained Project Scheduling, International Workshop on Project Management and Scheduling, Lisbon, juillet 1988.
  • [CARLIER 78] J. CARLIER, Ordonnancement à contraintes disjonctives, RAIRO, Rech. Opér., 1978, 72, n° 84, p. 333-350. [EuDML: 104705] [MR: 516514] [Zbl: 0401.90052]
  • [CARLIER 82A] J. CARLIER, One Machine Problem, Eur. J. Oper. Res., 1982, 11, p. 42-47. [MR: 671798] [Zbl: 0482.90045]
  • [CARLIER 82B] J. CARLIER, P. CHRETIENNE, Un domaine très ouvert : les problèmes d'ordonnancements, RAIRO, Rech. Opér., 1982, 16, p. 175-217. [EuDML: 104810] [Zbl: 0494.90040]
  • [CARLIER 84] J. CARLIER, Problèmes d'ordonnancements à contraintes de ressources : algorithmes et complexité, Thèse d'État, Université de Paris-VI, mai 1984.
  • [CARLIER 87A] J. CARLIER et E. PINSON, Résolution d'un job-shop 10 x 10, Rapport interne UTC GI HEUDIASYC, 1987.
  • [CARLIER 87B] J. CARLIER, Scheduling Jobs with Release Dates and Tails on Identical Machines to Minimize Makespan, European J. Oper. Res., 1987, 29, p. 298-306. [MR: 891314] [Zbl: 0622.90049]
  • [CARLIER 88A] J. CARLIER et P. CHRETIENNE, Problèmes d'ordonnancements : modélisation, algorithmes et complexité, Masson, Paris, 1988.
  • [CARLIER 88B] J. CARLIER and E. PINSON, The use of Jackson Preemptive Schedule for Solving the Job-Shop Problem, International Workshop on Project Management and Scheduling, Lisbon, juillet 1988. [Zbl: 0709.90061]
  • [CHRISTOFIDES 87] N. CHRISTOFIDES, R. ALVAREZ-VALDES and J. M. TAMARIT, Project Scheduling with Resource Constraints: A Branch and Bound Approach, European J. Oper. Res., 1987, 29, p. 262-273. [MR: 891312] [Zbl: 0614.90056]
  • [COOPER 76] D. F. COOPER, Heuristics for Scheduling Resource-Constrained Projects: an Experimental Investigation, Management Sci., 1976, 22, n° 11. [Zbl: 0326.90029]
  • [DAVIS 75] E. DAVIS and J. PATTERSON, A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling, Management Sci., 1975, 21, n° 8.
  • [GAREY 79] M. R. GAREY and D. S. JOHNSON, Computers and Intractabilîty: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979. [MR: 519066] [Zbl: 0411.68039]
  • [GRAHAM 69] R. L. GRAHAM, Bounds on Multiprocessing Timing Anomalies, SIAM J. Appl. Math., 1969, 17, p. 416-429. [MR: 249214] [Zbl: 0188.23101]
  • [HERROELEN 90] E. DEMEULEMEESTER and W. HERROELEN, A Decision Support System for Resource-Constrained Project Scheduling, International Workshop on Project Management and Scheduling, Université de Technologie de Compiègne, France, juin 1990. [Zbl: 0761.90059]
  • [MOCCELLIN 88] J. MOCCELLIN, On Directions in Resource-Constrained Project Scheduling, International Workshop on Project Management and Scheduling, Lisbon, juillet 1988.
  • [PATTERSON 76] J. H. PATTERSON and G. ROTH, Scheduling a Project Under Multiple Resource Constraints: a Zero-One Programming Approach, Management Sc., 1976, 16, p. 93-108.
  • [PINSON 88] E. PINSON, Le problème de job-shop, Thèse de l'Université de Paris-VI, 1988.
  • [SEDGEWICK 84] R. SEDGEWICK, Algorithms, Addison-Wesley, 1984. [MR: 784432] [Zbl: 0717.68005]

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.