IDEAS home Printed from https://ideas.repec.org/p/zbw/cauman/357.html
   My bibliography  Save this paper

Project scheduling with discrete time-resource and resource-resource tradeoffs

Author

Listed:
  • Sprecher, Arno
  • Hartmann, Sönke
  • Drexl, Andreas

Abstract

We consider an extension of the classical resource-constrained project scheduling problem (RCPSP), which covers discrete resource-resource and time-resource tradeoffs. As a result a project scheduler is permitted to identify several alternatives or modes of accomplishment for each activity of the project. The solution procedure we present is a considerable generalization of the branch-and-bound algorithm proposed by Demeulemeester and Herroelen, which is currently the most powerful method for optimally solving the RCPSP. More precisely, we extend their concept of delay alternatives by introducing mode alternatives. The basic enumeration scheme is then enhanced by dominance rules which highly increase the performance of the algorithm. The computational results obtained by solving the Standard ProGen instances indicate that the new method outperforms the most rapid procedure reported in the literature by a factor of four. Additionally and more important than the average reduction of the solution time is the substantial decrease of the variance of the solution times.

Suggested Citation

  • Sprecher, Arno & Hartmann, Sönke & Drexl, Andreas, 1994. "Project scheduling with discrete time-resource and resource-resource tradeoffs," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 357, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    • Handle: RePEc:zbw:cauman:357
    as

    Download full text from publisher

    File URL: https://www.econstor.eu/bitstream/10419/155428/1/manuskript_357.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Christofides, Nicos & Alvarez-Valdes, R. & Tamarit, J. M., 1987. "Project scheduling with resource constraints: A branch and bound approach," European Journal of Operational Research, Elsevier, vol. 29(3), pages 262-273, June.
    2. 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.
    3. Sprecher, Arno & Kolisch, Rainer & Drexl, Andreas, 1995. "Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 94-102, January.
    4. Hartmann, Sönke & Sprecher, Arno, 1993. "A note on "hierarchical models for multi-project planning and scheduling"," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 338, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Speranza, M. Grazia & Vercellis, Carlo, 1993. "Hierarchical models for multi-project planning and scheduling," European Journal of Operational Research, Elsevier, vol. 64(2), pages 312-325, January.
    6. Andreas Drexl, 1991. "Scheduling of Project Networks by Job Assignment," Management Science, INFORMS, vol. 37(12), pages 1590-1602, December.
    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. Drexl, Andreas & Kolisch, Rainer & Sprecher, Arno, 1995. "Neuere Entwicklungen in der computergestützten Projektplanung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 379, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Boctor, Fayez F., 1996. "A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes," European Journal of Operational Research, Elsevier, vol. 90(2), pages 349-361, April.
    3. Sprecher, Arno & Drexl, Andreas, 1996. "Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part II: Computation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 386, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Sprecher, Arno & Drexl, Andreas, 1996. "Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part I: Theory," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 385, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. S. Selcuk Erenguc & Taeho Ahn & Daniel G. Conway, 2001. "The resource constrained project scheduling problem with multiple crashable modes: An exact solution method," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(2), pages 107-127, March.
    6. Ahn, Taeho & Erenguc, S. Selcuk, 1998. "The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure," European Journal of Operational Research, Elsevier, vol. 107(2), pages 250-259, June.

    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. Hartmann, Sönke & Drexl, Andreas, 1997. "Project scheduling with multiple modes: A comparison of exact algorithms," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 430, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    3. Sprecher, Arno & Drexl, Andreas, 1996. "Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part I: Theory," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 385, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Sprecher, Arno, 1996. "Solving the RCPSP efficiently at modest memory requirements," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 425, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Sprecher, Arno & Drexl, Andreas, 1998. "Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm," European Journal of Operational Research, Elsevier, vol. 107(2), pages 431-450, June.
    6. 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.
    7. 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.
    8. Bianco, L. & Dell'Olmo, P. & Grazia Speranza, M., 1998. "Heuristics for multimode scheduling problems with dedicated resources," European Journal of Operational Research, Elsevier, vol. 107(2), pages 260-271, June.
    9. 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.
    10. Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
    11. Hartmann, Sönke, 1997. "Project scheduling with multiple modes: A genetic algorithm," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 435, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Ulusoy, Gunduz & Ozdamar, Linet, 1996. "A framework for an interactive project scheduling system under limited resources," European Journal of Operational Research, Elsevier, vol. 90(2), pages 362-375, April.
    13. Sprecher, Arno, 1998. "Non-equivalent search strategies for resource-constrained project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 493, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Sprecher, Arno & Drexl, Andreas, 1996. "Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part II: Computation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 386, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Kolisch, Rainer, 1996. "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation," European Journal of Operational Research, Elsevier, vol. 90(2), pages 320-333, April.
    16. 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.
    17. Drexl, Andreas & Kolisch, Rainer, 1994. "Model-based assembly management in machine tool manufacturing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 346, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.
    19. Sprecher, Arno & Drexl, Andreas, 1996. "Minimal delaying alternatives and semi-active timetabling in resource-constrained project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 426, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Nima Zoraghi & Aria Shahsavar & Babak Abbasi & Vincent Peteghem, 2017. "Multi-mode resource-constrained project scheduling problem with material ordering under bonus–penalty policies," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 49-79, April.

    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:zbw:cauman:357. 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: ZBW - Leibniz Information Centre for Economics (email available below). General contact details of provider: https://edirc.repec.org/data/ibkiede.html .

    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.