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

Exact Methods for the Resource Availability Cost Problem

In: Handbook on Project Management and Scheduling Vol.1

Author

Listed:
  • Savio B. Rodrigues

    (Federal University of São Carlos)

  • Denise S. Yamashita

    (Federal University of São Carlos)

Abstract

In this chapter, an exact method for the RACP problem is built from a combination of an RCPSP exact solver and RCPSP heuristic. In the RACP, the objective is to find the resource values that yield the least cost while finishing the project before the deadline. In the present method, the project feasibility is assessed by fixing the RACP resources and solving the underlying RCPSP with an exact algorithm. The idea is to reduce the number of RCPSP subproblems to be solved by sweeping the search space with a branching strategy that generates good bounds along the search. This approach is called the modified minimum bounding algorithm (MMBA). In the algorithm, we also employ a heuristic method in order to find an upper bound for the project cost. We fully describe the MMBA including possible alternative implementations. We also include an integer programming formulation of the RACP to be used directly or in subproblem solvers.

Suggested Citation

  • Savio B. Rodrigues & Denise S. Yamashita, 2015. "Exact Methods for the Resource Availability Cost Problem," 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 319-338, Springer.
    • Handle: RePEc:spr:ihichp:978-3-319-05443-8_15
    DOI: 10.1007/978-3-319-05443-8_15
    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. Patrick Gerhards, 2020. "The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 901-933, December.

    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_15. 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.