Abstract
This paper considers the Resource-Constrained Project Scheduling Problem with spatial resources (sRCPSP) which has complex scheduling features, such as divisibility, adjacency, group characteristics and exclusivity. Compared with typical Resource-Constrained Project Scheduling Problem (RCPSP), sRCPSP needs to answer not only the question of "When to schedule?" but also of "Where to schedule?". To solve sRCPSP, a mathematical model subjected to both spatial resource and common renewable resource constraints was established. Then, an Artificial Bee Colony Algorithm based meta-heuristic which took Priority List as its representation scheme and Activity Type Priority based serial scheduling algorithm for sRCPSP as decoding method was proposed. Numerical experiments results show that the algorithm is feasible, effective and robust, and it has outperformed the existing procedures.
| Original language | English |
|---|---|
| Pages (from-to) | 6723-6732 |
| Number of pages | 10 |
| Journal | Journal of Computational Information Systems |
| Volume | 8 |
| Issue number | 16 |
| State | Published - 15 Aug 2012 |
| Externally published | Yes |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 7 Affordable and Clean Energy
Keywords
- Artificial bee colony algorithms
- Project scheduling
- Resource-time blocks
- Spatial resources
Fingerprint
Dive into the research topics of 'An artificial bee colony algorithm for resource-constrained project scheduling problem with spatial resources'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver