Show simple item record

contributor authorRobert B. Harris
date accessioned2017-05-08T21:20:36Z
date available2017-05-08T21:20:36Z
date copyrightJune 1990
date issued1990
identifier other%28asce%290733-9364%281990%29116%3A2%28331%29.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/47730
description abstractA new heuristic for resource leveling based upon the critical path method is developed. The minimum moment of the resource histogram is used to measure the level of resources. The heuristic assigns project activities to specific days so that the final resource histogram approaches a rectangle and its moment approaches a minimum value. Activities are listed in a priority order and all possible assignments for each are determined. Incremental moments contributed by the activity's resource rate and penalties that recognize network interactions are calculated. Each activity is positioned in the time span where the sum of these quantities is a minimum. The histogram is thereby built step‐by‐step until all activities have been positioned within the constraints of a CPM or PERT network. The resulting leveled histogram is the same as, or very close to, that produced by other optimization or heuristic methods. The method is clear, logical, and computationally efficient whether the leveling is done manually or by computer. An example is solved to show the method's details and an appendix provides a concise outline of the process.
publisherAmerican Society of Civil Engineers
titlePacking Method for Resource Leveling (Pack)
typeJournal Paper
journal volume116
journal issue2
journal titleJournal of Construction Engineering and Management
identifier doi10.1061/(ASCE)0733-9364(1990)116:2(331)
treeJournal of Construction Engineering and Management:;1990:;Volume ( 116 ):;issue: 002
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record