Simplifying activity networks under generalized precedence relations to extended CPM networks

DOI10.1111/itor.12166zbMath1348.90163OpenAlexW2065701397MaRDI QIDQ2829161

Jian-xun Qi, Zhi-xiong Su, Zhinan Kan

Publication date: 27 October 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12166

zbMATH Keywords

network planningsimplificationgeneralized precedence relationsresource levelingCPM network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
• Robust resource allocations in temporal networks
• A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags
• Computing latest starting times of activities in interval-valued networks with minimal time lags
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• Project time-cost analysis under generalised precedence relations
• Mixed-integer linear programming for resource leveling problems
• A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• Criticality analysis in activity-on-node networks with minimal time lags
• The computational complexity of the criticality problems in a network with interval activity times

This page was built for publication: Simplifying activity networks under generalized precedence relations to extended CPM networks