IDEAS home Printed from https://ideas.repec.org/h/spr/ihichp/978-3-319-05443-8_18.html
   My bibliography  Save this book chapter

Heuristic Methods for Resource Leveling Problems

In: Handbook on Project Management and Scheduling Vol.1

Author

Listed:
  • Symeon E. Christodoulou

    (University of Cyprus)

  • Anastasia Michaelidou-Kamenou

    (University of Cyprus)

  • Georgios Ellinas

    (University of Cyprus)

Abstract

A novel resource-leveling algorithm is presented based on entropy concepts, restating the resource-leveling heuristic known as the “Minimum Moment Method”, as an “Entropy Maximization Method” and improving on its efficiency. The proposed resource-leveling algorithm makes use of the general theory of entropy and two of its principal properties (subadditivity and maximality) to restate resource leveling as a process of maximizing the entropy found in a project’s resource histogram. Entropy in this resource-centric problem domain is defined as the ratio of allocated daily resource units over the total number of resource units to complete the project. Entropy’s subadditivity and maximality properties state that if a system consists of two subdomains having n and m components respectively, then the total system entropy is less than or equal to the sum of the subdomains’ entropy, and that the entropy is maximum when all admissible outcomes have equal probabilities of occurrence (maximal uncertainty is reached for the equiprobability distribution of possible outcomes).

Suggested Citation

  • Symeon E. Christodoulou & Anastasia Michaelidou-Kamenou & Georgios Ellinas, 2015. "Heuristic Methods for Resource Leveling Problems," International Handbooks on Information Systems, in: Christoph Schwindt & Jürgen Zimmermann (ed.), Handbook on Project Management and Scheduling Vol.1, edition 127, chapter 0, pages 389-407, Springer.
    • Handle: RePEc:spr:ihichp:978-3-319-05443-8_18
    DOI: 10.1007/978-3-319-05443-8_18
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hartmann, Sönke & Briskorn, Dirk, 2022. "An updated survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 1-14.
    2. Felix Hübner & Patrick Gerhards & Christian Stürck & Rebekka Volk, 2021. "Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics," Journal of Scheduling, Springer, vol. 24(3), pages 269-290, June.

    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:ihichp:978-3-319-05443-8_18. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.