.png){kind=icon}
.png){kind=icon}
Return
On linear lower bounds for the resource constrained project scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00763-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The aim of this paper is to propose efficient methods for solving the resource constrained project scheduling problem (RCPSP). These methods are based on makespan lower bounds, which linearly depend on the processing times of the activities. Linear lower bounds (LLB) can be obtained in different ways. The first application that we present is a general linear programming scheme for computing a makespan lower bound. The second application consists in associating redundant resources with LLB. Consequently we get new adjustments of release dates and tails of the project activities. These adjustments are tight for certain RCPSP instances, as shown by our computational results. (C) 2003 Published by Elsevier Science B.V.
Keywords:
resource constrained project scheduling
linear programming
lower bounds
redundant resources
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