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

Jacques Carlier; Bruno Latapie

RAIRO - Operations Research - Recherche Opérationnelle (1991)

  • Volume: 25, Issue: 3, page 311-340
  • ISSN: 0399-0559

How to cite

top

Carlier, Jacques, and Latapie, Bruno. "Une méthode arborescente pour résoudre les problèmes cumulatifs." RAIRO - Operations Research - Recherche Opérationnelle 25.3 (1991): 311-340. <http://eudml.org/doc/105017>.

@article{Carlier1991,
author = {Carlier, Jacques, Latapie, Bruno},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {resource constraints; project scheduling; minimal makespan; precedence and cumulative constraints; NP-hardness; branch and bound},
language = {fre},
number = {3},
pages = {311-340},
publisher = {EDP-Sciences},
title = {Une méthode arborescente pour résoudre les problèmes cumulatifs},
url = {http://eudml.org/doc/105017},
volume = {25},
year = {1991},
}

TY - JOUR
AU - Carlier, Jacques
AU - Latapie, Bruno
TI - Une méthode arborescente pour résoudre les problèmes cumulatifs
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1991
PB - EDP-Sciences
VL - 25
IS - 3
SP - 311
EP - 340
LA - fre
KW - resource constraints; project scheduling; minimal makespan; precedence and cumulative constraints; NP-hardness; branch and bound
UR - http://eudml.org/doc/105017
ER -

References

top
  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

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.