New Network Model of the Project Scheduling Problem With Hybrid Precedence Relations and Maximum Activity Duration

DOI

10.2991/assehr.k.200826.224How to use a DOI?

Keywords

Activity networks, project scheduling, hybrid precedence relations, maximum time constraints

Abstract

This paper is a systematic study of the network model with hybrid precedence relations and maximum activity duration constraint in the unlimited resource case. Most traditional activity networks involve only four basic precedence relations, which makes it difficult to describe many complex practical situations clearly. Therefore, this paper proposes a new network model which can eliminate cycles in the traditional network and correctly reflect real precedence relations among activities. Activities with the maximum duration constraint are also considered in this paper. Furthermore, an effective time parameter algorithm is developed for new activity networks. To illustrate the usefulness of proposed network model and the effectiveness of its algorithm, a numerical example was solved using the new network algorithm and CPLEX Optimizer respectively. More importantly, the discovery of special activities ignored by traditional activity networks, such as passive activities, may further improve the theory of project scheduling.

Copyright

© 2020, 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  - CONF
AU  - Feng Kong
AU  - Jing Li
PY  - 2020
DA  - 2020/08/28
TI  - New Network Model of the Project Scheduling Problem With Hybrid Precedence Relations and Maximum Activity Duration
BT  - Proceedings of the 2020 4th International Seminar on Education, Management and Social Sciences (ISEMSS 2020)
PB  - Atlantis Press
SP  - 1086
EP  - 1089
SN  - 2352-5398
UR  - https://doi.org/10.2991/assehr.k.200826.224
DO  - 10.2991/assehr.k.200826.224
ID  - Kong2020
ER  -