Please use this identifier to cite or link to this item:
|dc.title||Total cost control in project management via satisficing|
|dc.identifier.citation||Goh, J., Hall, N.G. (2013-06). Total cost control in project management via satisficing. Management Science 59 (6) : 1354-1372. ScholarBank@NUS Repository. https://doi.org/10.1287/mnsc.1120.1653|
|dc.description.abstract||We consider projects with uncertain activity times and the possibility of expediting, or crashing, them. Activity times come from a partially specified distribution within a family of distributions. This family is described by one or more of the following details about the uncertainties: support, mean, and covariance. We allow correlation between past and future activity time performance across activities. Our objective considers total completion time penalty plus crashing and overhead costs. We develop a robust optimization model that uses a conditional value-at-risk satisficing measure. We develop linear and piecewise-linear decision rules for activity start time and crashing decisions. These rules are designed to perform robustly against all possible scenarios of activity time uncertainty, when implemented in either static or rolling horizon mode. We compare our procedures against the previously available Program Evaluation and Review Technique and Monte Carlo simulation procedures. Our computational studies show that, relative to previous approaches, our crashing policies provide both a higher level of performance, i.e., higher success rates and lower budget overruns, and substantial robustness to activity time distributions. The relative advantages and information requirements of the static and rolling horizon implementations are discussed. © 2013 INFORMS.|
|dc.subject||Linear decision rule|
|dc.subject||Robust optimization and satisficing|
|dc.subject||Time and cost control under uncertainty|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
checked on Jun 12, 2021
WEB OF SCIENCETM
checked on Jun 4, 2021
checked on Jun 7, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.