Resource-constraint Multi-project Scheduling with Priorities and Uncertain Activity Durations

DOI

10.1080/18756891.2013.789152How to use a DOI?

Keywords

Multi-Project Scheduling, Priorities, Robustness, Uncertain Activity Durations, Uncertainty

Abstract

Resource-constraint multi-project scheduling is one of the most important topic in the field of project management. Most current works solve this problem based on an idea that multiple projects can be simply emerged into a super-project in a deterministic environment, regardless of the project priority and robustness of schedules. This paper discusses the RCMPSP with priority and formulates a discrete bi-objective decision model. A modified NSGA-II based algorithm is presented to solve the model. Furthermore, we design systematic experiments to investigate the interrelationship between robustness and its related project parameters, including order strength, resource constrainedness and uncertainty level. The results demonstrate the effectiveness of the solution algorithm and show that the three parameters indeed have evident impacts on the robustness and makespan of projects.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - JOUR
AU  - Zheng Zheng
AU  - Lin Shumin
AU  - Guo Ze
AU  - Zhu Yueni
PY  - 2013
DA  - 2013/05/01
TI  - Resource-constraint Multi-project Scheduling with Priorities and Uncertain Activity Durations
JO  - International Journal of Computational Intelligence Systems
SP  - 530
EP  - 547
VL  - 6
IS  - 3
SN  - 1875-6883
UR  - https://doi.org/10.1080/18756891.2013.789152
DO  - 10.1080/18756891.2013.789152
ID  - Zheng2013
ER  -