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

Resource optimisation in line of balance scheduling

Author

Listed:
  • Mohammad A. Ammar

Abstract

The Critical Path Method (CPM) has failed practically for scheduling repetitive projects and Line Of Balance (LOB) has emerged as an alternative for scheduling such projects. Because of the size of most repetitive projects, efficient resource management plays a vital role in their successful implementation. However, resource levelling and allocation have not been formally investigated in repetitive projects. Heuristic methods and optimization techniques have been traditionally used to solve resource scheduling problems like the latter. Although heuristic methods can handle large-size projects, they do not guarantee optimal solutions. In this paper, resource levelling and allocation problems under LOB scheme are modelled as an optimization problem that guarantees optimal solutions. Resource continuity and logical dependency between activities are maintained where constant activity progress rate is assumed. An example project is used to demonstrate the details of model formulation. A complete solution for the range of feasible project durations is obtained as a Time-Resource Trade-Off curve. A pipeline project is used to validate the developed model revealing that the developed model is superior. The proposed model provides contractors with a complete picture for resource usage along with the range of feasible project durations from which the optimal alternative can be selected.

Suggested Citation

  • Mohammad A. Ammar, 2020. "Resource optimisation in line of balance scheduling," Construction Management and Economics, Taylor & Francis Journals, vol. 38(8), pages 715-725, August.
  • Handle: RePEc:taf:conmgt:v:38:y:2020:i:8:p:715-725
    DOI: 10.1080/01446193.2019.1606924
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01446193.2019.1606924
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01446193.2019.1606924?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.

    More about this item

    Statistics

    Access and download statistics

    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:38:y:2020:i:8:p:715-725. 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.