Name
Title | ||
|---|---|---|
Solving the resource-constrained project scheduling problem by a variable neighbourhood search |
Abstract | ||
|---|---|---|
The well-known, challenging problem of resource-constrained project scheduling is addressed. A solution scheme based on variable neighbourhood search is presented. The solution is coded by using activity sequences that are valid in terms of precedence constraints. The sequences are turned into valid active schedules through a serial scheduler. The search of the solution space is carried out via generating valid sequences using two types of move strategy. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/S0377-2217(02)00884-6 | European Journal of Operational Research |
Keywords | Field | DocType |
Scheduling,Variable neighbourhood search,Heuristics | Small number,Schedule (project management),Mathematical optimization,Scheduling (computing),Precedence diagram method,Nurse scheduling problem,Schedule,Heuristics,Mathematics,Bounding overwatch | Journal |
Volume | Issue | ISSN |
155 | 2 | 0377-2217 |
Citations | PageRank | References |
51 | 3.05 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Krzysztof Fleszar | 1 | 368 | 25.38 |
| Khalil S. Hindi | 2 | 398 | 22.75 |