Simplifying activity networks under generalized precedence relations to extended CPM networks

DOI10.1111/ITOR.12166MaRDI QIDQ2829161zbMATH OpenOpenAlexFDO

Authors Zhi-Xiong Su, Jian-Xun Qi, Zhi-Nan 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

generalized precedence relationsresource levelingnetwork planningsimplificationCPM network

Mathematics Subject Classification ID

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

Recommendations

• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• Publication:4509382
• Prallel algorithms for analyzing activity networks
• Critical activity analysis in precedence diagram method scheduling network
• Reducing complex CSP models to traces via priority
• Activity preserving graph simplification
• Approximating the Criticality Indices of the Activities in PERT Networks
• A generalized activity network model
• PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS
• On the computational complexity of the minimum-dummy-activities problem in a pert network

Cites work

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

Cited in

(1)

• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829161)