Construction planners face the decisions of selecting appropriate resources, including crew sizes, equipment, methods, and technologies, to perform the tasks of a construction project. In general, there is a trade-off between time and cost - the less expensive the resources, the longer it takes. Using CPM techniques, the overall project cost can be reduced by using less expensive resources for non-critical activities without impacting the duration. Furthermore, planners usually need to adjust the selection of resources in order to shorten or lengthen the project duration. Finding the optimal decisions is difficult and time-consuming, considering the numbers of permutations involved. For example, a CPM network with only 8 activities, each with two options, will have 256 (28) alternatives. Exhaustive enumeration is not economically feasible even with very fast computers. This paper presents a new algorithm using linear and integer programming to efficiently obtain optimal resource selections that balance time and cost for a construction project.
|出版狀態||Published - 1995 1月 1|
|事件||Proceedings of the 2nd Congress on Computing in Civil Engineering. Part 1 (of 2) - Atlanta, GA, USA|
持續時間: 1995 6月 5 → 1995 6月 8
|Other||Proceedings of the 2nd Congress on Computing in Civil Engineering. Part 1 (of 2)|
|城市||Atlanta, GA, USA|
|期間||95-06-05 → 95-06-08|
All Science Journal Classification (ASJC) codes