.png){kind=icon}
.png){kind=icon}
Return
Insertion techniques for static and dynamic resource-constrained project scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00758-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2003 Elsevier Science B.V. All rights reserved.
Keywords:
resource-constrained project scheduling
activity-on-node/flow network
activity insertion
robust scheduling
tabu search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available