Scheduling project networks with resource constraints and time windows
- 1 December 1988
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 16 (1) , 199-240
- https://doi.org/10.1007/bf02283745
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Schedule-induced posetsDiscrete Applied Mathematics, 1986
- Scheduling of project networksAnnals of Operations Research, 1985
- Algorithmic Aspects of Comparability Graphs and Interval GraphsPublished by Springer Nature ,1985
- Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion TimeOperations Research, 1984
- An algorithm for generating all maximal independent subsets of posetsComputing, 1981
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling ProblemsManagement Science, 1978
- Complexity of Scheduling under Precedence ConstraintsOperations Research, 1978
- Ordonnancements à contraintes disjonctivesRairo-Operations Research, 1978