Insertion techniques for static and dynamic resource-constrained project scheduling

  • Artigues C
  • Michelon P
  • Reusser S
  • 83


    Mendeley users who have this article in their library.
  • 125


    Citations of this article.


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.

Author-supplied keywords

  • Activity insertion
  • Activity-on-node/flow network
  • Resource-constrained project scheduling
  • Robust scheduling
  • Tabu search

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Christian Artigues

  • Philippe Michelon

  • Stéphane Reusser

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free