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

Solving the RCPSP efficiently at modest memory requirements

Author

Listed:
  • Sprecher, Arno

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:zbw:cauman:425
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Slowinski, Roman & Soniewicki, Boleslaw & Weglarz, Jan, 1994. "DSS for multiobjective project scheduling," European Journal of Operational Research, Elsevier, vol. 79(2), pages 220-229, December.
    2. Patterson, James H. & Brian Talbot, F. & Slowinski, Roman & Weglarz, Jan, 1990. "Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems," European Journal of Operational Research, Elsevier, vol. 49(1), pages 68-79, November.
    3. 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.
    4. Herroelen, Willy S. & Demeulemeester, Erik L., 1996. "Project management and scheduling," European Journal of Operational Research, Elsevier, vol. 90(2), pages 197-199, April.
    5. 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.
    6. Erik Demeulemeester & Willy Herroelen, 1992. "A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 38(12), pages 1803-1818, December.
    7. 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.
    8. 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.
    9. Rainer Kolisch & Arno Sprecher & Andreas Drexl, 1995. "Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems," Management Science, INFORMS, vol. 41(10), pages 1693-1703, October.
    10. 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.
    11. F. Brian Talbot & James H. Patterson, 1978. "An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems," Management Science, INFORMS, vol. 24(11), pages 1163-1174, July.
    12. Andreas Drexl, 1991. "Scheduling of Project Networks by Job Assignment," Management Science, INFORMS, vol. 37(12), pages 1590-1602, December.
    13. James H. Patterson, 1984. "A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem," Management Science, INFORMS, vol. 30(7), pages 854-867, July.
    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. Klein, Robert & Scholl, Armin, 1999. "Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 112(2), pages 322-346, January.
    2. Boysen, Ole & Juretzka, Jan & Kimms, Alf, 1999. "Ameisen-Systeme zur kapitalwertmaximierenden Projektplanung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 499, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. 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.
    4. 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.
    5. Valls, Vicente & Quintanilla, Sacramento & Ballestin, Francisco, 2003. "Resource-constrained project scheduling: A critical activity reordering heuristic," European Journal of Operational Research, Elsevier, vol. 149(2), pages 282-301, September.
    6. Schirmer, Andreas & Riesenberg, Sven, 1998. "Class-based control schemes for parameterized project scheduling heuristics," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 471, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Sprecher, Arno, 1997. "A competitive exact algorithm for assembly line balancing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 449, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Hartmann, Sönke, 1997. "Scheduling medical research experiments - an application of project scheduling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 452, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Hartmann, Sönke, 1999. "Self-adapting genetic algorithms with an application to project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 506, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Pfeifer, Jeremy & Barker, Kash & Ramirez-Marquez, Jose E. & Morshedlou, Nazanin, 2015. "Quantifying the risk of project delays with a genetic algorithm," International Journal of Production Economics, Elsevier, vol. 170(PA), pages 34-44.
    11. 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.
    12. Kolisch, Rainer & Hartmann, Sönke, 1998. "Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 469, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Hartmann, Sönke, 1997. "A comparative genetic algorithm for resource-constraint project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 451, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    2. 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.
    3. 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.
    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. 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.
    6. 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.
    7. Kolisch, Rainer & Sprecher, Arno, 1997. "PSPLIB - A project scheduling problem library : OR Software - ORSEP Operations Research Software Exchange Program," European Journal of Operational Research, Elsevier, vol. 96(1), pages 205-216, January.
    8. 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.
    9. 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.
    10. 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.
    11. Klein, Robert & Scholl, Armin, 1999. "Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 112(2), pages 322-346, January.
    12. Böttcher, Jan & Drexl, Andreas & Kolisch, Rainer & Salewski, Frank, 1996. "Project scheduling under partially renewable resource constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 398, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Bert De Reyck & Erik Demeulemeester & Willy Herroelen, 1998. "Local search methods for the discrete time/resource trade‐off problem in project networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(6), pages 553-578, September.
    14. 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.
    15. 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.
    16. Kolisch, Rainer & Sprecher, Arno, 1996. "PSPLIB - a project scheduling problem library," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 396, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    17. 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.
    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. Aristide Mingozzi & Vittorio Maniezzo & Salvatore Ricciardelli & Lucio Bianco, 1998. "An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation," Management Science, INFORMS, vol. 44(5), pages 714-729, May.
    20. Dayal Madhukar & Verma, Sanjay, 2014. "Breadth-first and Best-first Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2014-10-04, Indian Institute of Management Ahmedabad, Research and Publication Department.

    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:425. 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.