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. © 2003 Elsevier Science B.V. All rights reserved.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below