| Article ID: | iaor20043038 |
| Country: | Netherlands |
| Volume: | 149 |
| Issue: | 2 |
| Start Page Number: | 249 |
| End Page Number: | 267 |
| Publication Date: | Sep 2003 |
| Journal: | European Journal of Operational Research |
| Authors: | Michelon Philippe, Artigues Christian, Reusser Stphane |
| Keywords: | scheduling, heuristics |
A flow network model is presented for the static resource-constrained project scheduling problem. Static and dynamic scheduling methods, based on a new polynomial insertion algorithm taking advantage on the flow structure, are proposed. The performed computational experiments on some state-of-the-art problem instances show the potential of this approach.