IDEAS home Printed from https://ideas.repec.org/a/taf/conmgt/v19y2001i6p643-651.html
   My bibliography  Save this article

Resource allocation heuristic in construction simulation

Author

Listed:
  • Zhang Hong
  • C. M. Tam
  • Jonathan Shi

Abstract

The quantity of some resources is limited because of project cost constraints. These resources may be required by multiple activities simultaneously during a construction process. In a discrete simulation that models the construction process, tracing and controlling such entities, e.g. resources, is crucial to simulation. This paper presents a resource allocation point (RAP) heuristic that takes into account the dynamic and stochastic charateristics of simulation to enable the activity-based construction simulation system to process a decision-making ability, i.e. allocating the limited resources to the multiple computing activites during simulation. In addition, this paper introduces an activity object-orientated approach that implements the RAP heuristic and speeds up the simulation experimentation through initiating and checking only related activity objects instead of scanning all activities as in a pure activity scanning (AS) simulation strategy.

Suggested Citation

  • Zhang Hong & C. M. Tam & Jonathan Shi, 2001. "Resource allocation heuristic in construction simulation," Construction Management and Economics, Taylor & Francis Journals, vol. 19(6), pages 643-651.
  • Handle: RePEc:taf:conmgt:v:19:y:2001:i:6:p:643-651
    DOI: 10.1080/01446190110063473
    as

    Download full text from publisher

    File URL: http://www.tandfonline.com/doi/abs/10.1080/01446190110063473
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01446190110063473?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:conmgt:v:19:y:2001:i:6:p:643-651. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RCME20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.