.png){kind=icon}
.png){kind=icon}
Return
The multi-mode resource-constrained project scheduling problem with generalized precedence relations
.png){kind=icon}
OA
AI
DOI：10.1016/S0377-2217(99)00151-4.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we tackle the challenging problem of scheduling activities to minimize the project: duration, in which the activities (a) are subject to generalized precedence relations, (b) require units of multiple renewable, non-renewable and doubly constrained resources for which a limited availability is imposed, and (c) can be performed in one of several different ways, reflected in multiple activity scenarios or modes. These multiple modes give rise to several kinds of tradeoffs (time/resource, time/cost and resource/resource trade-offs) which allow for a more efficient allocation and use of resources. We present a local search-based solution methodology which is able to handle many real-life project scheduling characteristics such as time-varying resource requirements and availabilities, activity ready times, due dates and deadlines, activity overlaps, activity start time constraints and other types of temporal constraints. (C) 1999 Elsevier Science B.V. All rights reserved.
Keywords:
project management
planning and scheduling
generalized precedence relations
multiple activity modes
heuristics
local search
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