Une méthode arborescente pour résoudre les problèmes cumulatifs
Open Access
- 1 January 1991
- journal article
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 25 (3), 311-340
- https://doi.org/10.1051/ro/1991250303111
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Scheduling jobs with release dates and tails on identical machines to minimize the makespanEuropean Journal of Operational Research, 1987
- Project scheduling with resource constraints: A branch and bound approachEuropean Journal of Operational Research, 1987
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- Un domaine très ouvert : les problèmes d'ordonnancementRAIRO - Operations Research, 1982
- Ordonnancements à contraintes disjonctivesRAIRO - Operations Research, 1978
- Heuristics for Scheduling Resource-Constrained Projects: An Experimental InvestigationManagement Science, 1976
- A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project SchedulingManagement Science, 1975
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969