IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v38y2016i2d10.1007_s00291-016-0435-1.html
   My bibliography  Save this article

Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities

Author

Listed:
  • Lucio Bianco

    () (University of Rome “Tor Vergata”)

  • Massimiliano Caramia

    () (University of Rome “Tor Vergata”)

  • Stefano Giordani

    () (University of Rome “Tor Vergata”)

Abstract

Abstract We study the problem of levelling resources in a project with generalized precedence relationships, given a deadline for the completion of all the activities and variable execution intensities and flexible durations of the activities. Variable execution intensities have been taken into account firstly by Kis (Math Program 103(3):515–539, 2005) applied to a real world scenario in which, due to the physical characteristics of some manufacturing processes, the effort associated with a certain activity for its execution may vary over time. Generalized precedence relationships and variable intensity execution and duration have not been dealt with together to the best of our knowledge. For this novel problem we propose a mixed-integer linear programming formulation, a lower bound based on Lagrangian relaxation, and a branch and bound algorithm. Computational results on known benchmarks are provided.

Suggested Citation

  • Lucio Bianco & Massimiliano Caramia & Stefano Giordani, 2016. "Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 405-425, March.
  • Handle: RePEc:spr:orspec:v:38:y:2016:i:2:d:10.1007_s00291-016-0435-1
    DOI: 10.1007/s00291-016-0435-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-016-0435-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

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

    References listed on IDEAS

    as
    1. Bianco, Lucio & Caramia, Massimiliano, 2012. "An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 219(1), pages 73-85.
    2. Fündeling, C.-U. & Trautmann, N., 2010. "A priority-rule method for project scheduling with work-content constraints," European Journal of Operational Research, Elsevier, vol. 203(3), pages 568-574, June.
    3. Rieck, Julia & Zimmermann, Jürgen & Gather, Thorsten, 2012. "Mixed-integer linear programming for resource leveling problems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 27-37.
    Full references (including those not matched with items on IDEAS)

    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:spr:orspec:v:38:y:2016:i:2:d:10.1007_s00291-016-0435-1. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.