IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v56y2005i4d10.1057_palgrave.jors.2601827.html
   My bibliography  Save this article

A new heuristic for the multi-mode resource investment problem

Author

Listed:
  • C-C Hsu

    (General Motors Engineering)

  • D S Kim

    (Oregon State University)

Abstract

This paper considers the problem of minimizing resource investment required to execute the tasks in a project network by a given project due date. A project consists of non-pre-emptive tasks executed in a known and required precedence order. Each task is completed in one of its feasible modes, which may differ not only in task duration but also in consumption of renewable resources. A priority rule heuristic with polynomial computational complexity is presented for this computationally intractable problem. This heuristic simultaneously considers due date constraints and resource usage to select and schedule tasks with one decision rule. This differs from prior multi-mode priority rule scheduling heuristics that apply two consecutive decision rules to schedule tasks. Extensive computational testing indicates promising results.

Suggested Citation

  • C-C Hsu & D S Kim, 2005. "A new heuristic for the multi-mode resource investment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 406-413, April.
    • Handle: RePEc:pal:jorsoc:v:56:y:2005:i:4:d:10.1057_palgrave.jors.2601827
    DOI: 10.1057/palgrave.jors.2601827
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601827
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601827?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.

    References listed on IDEAS

    as
    1. Slowinski, Roman, 1981. "Multiobjective network scheduling with efficient use of renewable and nonrenewable resources," European Journal of Operational Research, Elsevier, vol. 7(3), pages 265-273, July.
    2. Erik Demeulemeester, 1995. "Minimizing Resource Availability Costs in Time-Limited Project Networks," Management Science, INFORMS, vol. 41(10), pages 1590-1598, October.
    3. Rolf H. Möhring, 1984. "Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time," Operations Research, INFORMS, vol. 32(1), pages 89-120, February.
    4. F. Brian Talbot, 1982. "Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case," Management Science, INFORMS, vol. 28(10), pages 1197-1210, October.
    5. Neumann, K. & Zimmermann, J., 1999. "Resource levelling for projects with schedule-dependent time windows," European Journal of Operational Research, Elsevier, vol. 117(3), pages 591-605, September.
    6. Boctor, Fayer F., 1990. "Some efficient multi-heuristic procedures for resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 49(1), pages 3-13, November.
    7. Lawrence, Stephen R. & Morton, Thomas E., 1993. "Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics," European Journal of Operational Research, Elsevier, vol. 64(2), pages 168-187, January.
    8. I. Kurtulus & E. W. Davis, 1982. "Multi-Project Scheduling: Categorization of Heuristic Rules Performance," Management Science, INFORMS, vol. 28(2), pages 161-172, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Fink, Andreas & Gerhards, Patrick, 2021. "Negotiation mechanisms for the multi-agent multi-mode resource investment problem," European Journal of Operational Research, Elsevier, vol. 295(1), pages 261-274.
    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.
    3. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    4. Kreter, Stefan & Schutt, Andreas & Stuckey, Peter J. & Zimmermann, Jürgen, 2018. "Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 472-486.
    5. Cédric Verbeeck & Vincent Peteghem & Mario Vanhoucke & Pieter Vansteenwegen & El-Houssaine Aghezzaf, 2017. "A metaheuristic solution approach for the time-constrained project scheduling problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 353-371, March.
    6. 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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vo[ss], Stefan & Witt, Andreas, 2007. "Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application," International Journal of Production Economics, Elsevier, vol. 105(2), pages 445-458, February.
    2. Browning, Tyson R. & Yassine, Ali A., 2010. "Resource-constrained multi-project scheduling: Priority rule performance revisited," International Journal of Production Economics, Elsevier, vol. 126(2), pages 212-228, August.
    3. Lova, Antonio & Maroto, Concepcion & Tormos, Pilar, 2000. "A multicriteria heuristic method to improve resource allocation in multiproject scheduling," European Journal of Operational Research, Elsevier, vol. 127(2), pages 408-424, December.
    4. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    5. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    6. Salewski, Frank & Schirmer, Andreas & Drexl, Andreas, 1997. "Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application," European Journal of Operational Research, Elsevier, vol. 102(1), pages 88-110, October.
    7. Salewski, Frank & Schirmer, Andreas & Drexl, Andreas, 1996. "Project Scheduling under Resource and Mode Identity Constraints. Part I: Model, Complexity Status, and Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 387, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Drexl, Andreas & Grünewald, Jürgen, 1989. "Nonpreemptive multi-mode resource-constrained project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 236, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    10. Salewski, Frank, 1994. "An integrative approach to audit-staff scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 358, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Kolisch, Rainer & Sprecher, Arno & Drexl, Andreas, 1992. "Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 301, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Bredael, Dries & Vanhoucke, Mario, 2023. "Multi-project scheduling: A benchmark analysis of metaheuristic algorithms on various optimisation criteria and due dates," European Journal of Operational Research, Elsevier, vol. 308(1), pages 54-75.
    13. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Cédric Verbeeck & Vincent Peteghem & Mario Vanhoucke & Pieter Vansteenwegen & El-Houssaine Aghezzaf, 2017. "A metaheuristic solution approach for the time-constrained project scheduling problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 353-371, March.
    15. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    16. Gonçalves, J.F. & Mendes, J.J.M. & Resende, M.G.C., 2008. "A genetic algorithm for the resource constrained multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1171-1190, September.
    17. Kolisch, Rainer, 1994. "Serial and parallel resource-constrained projekt scheduling methodes revisited: Theory and computation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 344, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Anıl Can & Gündüz Ulusoy, 2014. "Multi-project scheduling with two-stage decomposition," Annals of Operations Research, Springer, vol. 217(1), pages 95-116, June.
    19. Yukang He & Tao Jia & Weibo Zheng, 2024. "Simulated annealing for centralised resource-constrained multiproject scheduling to minimise the maximal cash flow gap under different payment patterns," Annals of Operations Research, Springer, vol. 338(1), pages 115-149, July.
    20. Kreter, Stefan & Schutt, Andreas & Stuckey, Peter J. & Zimmermann, Jürgen, 2018. "Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 472-486.

    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:pal:jorsoc:v:56:y:2005:i:4:d:10.1057_palgrave.jors.2601827. 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.

    If CitEc recognized a bibliographic 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.

    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.palgrave-journals.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.