A discrete-time approximation technique for the time-cost trade-off in PERT networks

DOI10.1051/RO:2007005zbMATH Open1377.90082OpenAlexW2093696851MaRDI QIDQ4600613

R. Tavakkoli-Moghaddam, Masatoshi Sakawa, Amir Azaron

Publication date: 12 January 2018

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2007__41_1_61_0/

zbMATH Keywords

optimal controlsimulated annealingMarkov processesproject managementmultiple objective programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Efficient sensitivity analysis of PERT network performance measures to significant changes in activity time parameters

This page was built for publication: A discrete-time approximation technique for the time-cost trade-off in PERT networks

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