Une méthode arborescente pour résoudre les problèmes cumulatifs

 Access to full text

 Full (PDF)

1. [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. 
2. [CARLIER 78] J. CARLIER, Ordonnancement à contraintes disjonctives, RAIRO, Rech. Opér., 1978, 72, n° 84, p. 333-350. Zbl0401.90052MR516514
3. [CARLIER 82A] J. CARLIER, One Machine Problem, Eur. J. Oper. Res., 1982, 11, p. 42-47. Zbl0482.90045MR671798
4. [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. Zbl0494.90040
5. [CARLIER 84] J. CARLIER, Problèmes d'ordonnancements à contraintes de ressources : algorithmes et complexité, Thèse d'État, Université de Paris-VI, mai 1984. 
6. [CARLIER 87A] J. CARLIER et E. PINSON, Résolution d'un job-shop 10 x 10, Rapport interne UTC GI HEUDIASYC, 1987. 
7. [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. Zbl0622.90049MR891314
8. [CARLIER 88A] J. CARLIER et P. CHRETIENNE, Problèmes d'ordonnancements : modélisation, algorithmes et complexité, Masson, Paris, 1988. 
9. [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. Zbl0709.90061
10. [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. Zbl0614.90056MR891312
11. [COOPER 76] D. F. COOPER, Heuristics for Scheduling Resource-Constrained Projects: an Experimental Investigation, Management Sci., 1976, 22, n° 11. Zbl0326.90029
12. [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. 
13. [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. Zbl0411.68039MR519066
14. [GRAHAM 69] R. L. GRAHAM, Bounds on Multiprocessing Timing Anomalies, SIAM J. Appl. Math., 1969, 17, p. 416-429. Zbl0188.23101MR249214
15. [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. Zbl0761.90059
16. [MOCCELLIN 88] J. MOCCELLIN, On Directions in Resource-Constrained Project Scheduling, International Workshop on Project Management and Scheduling, Lisbon, juillet 1988. 
17. [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. 
18. [PINSON 88] E. PINSON, Le problème de job-shop, Thèse de l'Université de Paris-VI, 1988. 
19. [SEDGEWICK 84] R. SEDGEWICK, Algorithms, Addison-Wesley, 1984. Zbl0717.68005MR784432

1. Odile Bellenguez-Morineau, Emmanuel Néron, A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem