Project bidding under deterministic and probabilistic activity durations

DOI10.1016/0377-2217(90)90117-TzbMath1403.90318MaRDI QIDQ721677

Salah E. Elmaghraby

Publication date: 19 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

PERTactivity networksCPMproject bidding

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Resource allocation for a stochastic CPM-type network through perturbation analysis, A comparison of stochastic scheduling rules for maximizing project net present value, A classified bibliography of recent research relating to project risk management, Activity nets: A guided tour through some recent developments, Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks, Simple probability models for project contracting, A review of the contribution of operational research to project management, An integer linear programming model and a modified branch and bound algorithm for the project material requirements planning problem, Neural network as a simulation metamodel in economic analysis of risky projects

Cites Work

• Unnamed Item
• Approximating the Criticality Indices of the Activities in PERT Networks
• Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
• Unbalanced Highway Contract Tendering
• Application of a Technique for Research and Development Program Evaluation
• Cash Flows in Networks
• The payment scheduling problem