Premium
Simplifying activity networks under generalized precedence relations to extended CPM networks
Author(s) -
Su ZhiXiong,
Qi JianXun,
Kan ZhiNan
Publication year - 2016
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12166
Subject(s) - general packet radio service , computer science , relation (database) , representation (politics) , critical path method , path (computing) , resource (disambiguation) , distributed computing , simple (philosophy) , computer network , telecommunications , engineering , data mining , philosophy , systems engineering , epistemology , politics , political science , law , wireless
The critical path method (CPM) is a network planning technology with a simple and intuitive representation. However, it can only represent a special precedence relation—the finish‐to‐start minimum time lag. Currently, generalized precedence relations (GPRs) are represented by complex activity networks. We simplify complex activity networks under GPRs by representing the GPRs in a new way. This new extended CPM network is similar to the standard CPM network with the exception that arcs may have negative lengths and cycles. The extended CPM network facilitates problems with GPRs. Although many current models and algorithms are advanced and efficient for the CPM network problem, they are difficult or impossible to improve for GPRs applications. The extended CPM network, however, combats these problems and serves as an illustration of resource leveling with activity splitting. The current 0‐1 binary model formulation for the resource leveling with just finish‐to‐start minimum time lags is also applied to the problem with GPRs using the extended CPM network.