IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v107y1998i2p250-259.html
   My bibliography  Save this article

The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure

Author

Listed:
  • Ahn, Taeho
  • Erenguc, S. Selcuk

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:107:y:1998:i:2:p:250-259
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00331-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. 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.
    2. 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.
    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. 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. D. R. Fulkerson, 1961. "A Network Flow Computation for Project Cost Curves," Management Science, INFORMS, vol. 7(2), pages 167-178, January.
    6. Edward W. Davis & James H. Patterson, 1975. "A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling," Management Science, INFORMS, vol. 21(8), pages 944-955, April.
    7. 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.
    8. James H. Patterson & Walter D. Huber, 1974. "A Horizon-Varying, Zero-One Approach to Project Scheduling," Management Science, INFORMS, vol. 20(6), pages 990-998, February.
    9. 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.
    10. E. B. Berman, 1964. "Resource Allocation in a PERT Network Under Continuous Activity Time-Cost Functions," Management Science, INFORMS, vol. 10(4), pages 734-745, July.
    11. 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.
    12. L. R. Lamberson & R. R. Hocking, 1970. "Optimum Time Compression in Project Scheduling," Management Science, INFORMS, vol. 16(10), pages 597-606, June.
    13. James E. Falk & Joel L. Horowitz, 1972. "Critical Path Problems with Concave Cost-Time Curves," Management Science, INFORMS, vol. 19(4-Part-1), pages 446-455, December.
    14. 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.
    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. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    2. Herroelen, Willy & Leus, Roel, 2004. "The construction of stable project baseline schedules," European Journal of Operational Research, Elsevier, vol. 156(3), pages 550-565, August.
    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. Chatterjee A K & Mukherjee, Saral, 2006. "Unified Concept of Bottleneck," IIMA Working Papers WP2006-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. Tavares, L. V., 2002. "A review of the contribution of Operational Research to Project Management," European Journal of Operational Research, Elsevier, vol. 136(1), pages 1-18, January.

    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. 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.
    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. 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.
    5. Kolisch, Rainer, 1994. "Efficient priority rules for the resource-constrained project scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 350, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. Yang, Kum Khiong & Tay, Lee Choo & Sum, Chee Chuong, 1995. "A comparison of stochastic scheduling rules for maximizing project net present value," European Journal of Operational Research, Elsevier, vol. 85(2), pages 327-339, September.
    16. Elmaghraby, Salah E., 1995. "Activity nets: A guided tour through some recent developments," European Journal of Operational Research, Elsevier, vol. 82(3), pages 383-408, May.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:107:y:1998:i:2:p:250-259. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.