IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v37y1990i1p61-84.html
   My bibliography  Save this article

Solving resource‐constrained project scheduling problems by a* search

Author

Listed:
  • Colin E. Bell
  • Kwangho Park

Abstract

A new exact method is presented for finding a minimum makespan schedule for a multiresource constrained project scheduling problem. This method employs the philosophical approach used earlier to develop a successful heuristic algorithm for the same class of problems. The approach repairs resource conflicts rather than constructing detailed schedules by dispatching activities. Resource‐violating sets of activities are identified whose concurrent execution would violate resource constraints. Repairs are made by imposing a precedence constraint to sequence two activities in such a resource‐violating set. Computational results are discussed for a standard set of test problems. An A* algorithm is employed. The most successful version of our algorithm involves some perhaps surprising design choices which might be relevant to the design of A*‐like search algorithms in other contexts.

Suggested Citation

  • Colin E. Bell & Kwangho Park, 1990. "Solving resource‐constrained project scheduling problems by a* search," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 61-84, February.
    • Handle: RePEc:wly:navres:v:37:y:1990:i:1:p:61-84
    DOI: 10.1002/1520-6750(199002)37:13.0.CO;2-S
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199002)37:13.0.CO;2-S
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199002)37:13.0.CO;2-S?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
    ---><---

    References listed on IDEAS

    as
    1. Linus Schrage, 1970. "Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case," Operations Research, INFORMS, vol. 18(2), pages 263-278, April.
    2. 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. Guo, Weikang & Vanhoucke, Mario & Coelho, José, 2023. "A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 579-595.
    2. Scott E. Sampson & Elliott N. Weiss, 1993. "Local search techniques for the generalized resource constrained project scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(5), pages 665-675, August.
    3. Colin E. Bell & Jaemin Han, 1991. "A new heuristic solution method in resource‐constrained project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 315-331, 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. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    2. Abdollah Arasteh, 2020. "Considering Project Management Activities for Engineering Design Groups," SN Operations Research Forum, Springer, vol. 1(4), pages 1-29, December.
    3. M. Vanhoucke & J. Coelho & L. V. Tavares & D. Debels, 2004. "On The Morphological Structure Of A Network," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 04/272, Ghent University, Faculty of Economics and Business Administration.
    4. Salewski, Frank & Schirmer, Andreas & Drexl, Andreas, 1996. "Project Scheduling under Resource and Mode Identity Constraints. Part II: An Application to Audit-Staff Scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 388, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Drexl, Andreas & Nissen, Rudiger & Patterson, James H. & Salewski, Frank, 2000. "ProGen/[pi]x - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions," European Journal of Operational Research, Elsevier, vol. 125(1), pages 59-72, August.
    6. Sönke Hartmann, 1998. "A competitive genetic algorithm for resource‐constrained project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(7), pages 733-750, October.
    7. Carlier, Jacques & Neron, Emmanuel, 2000. "A new LP-based lower bound for the cumulative scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 363-382, December.
    8. 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.
    9. Simpson, Wendell P. & Patterson, James H., 1996. "A multiple-tree search procedure for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 525-542, March.
    10. Viana, Ana & Pinho de Sousa, Jorge, 2000. "Using metaheuristics in multiobjective resource constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 120(2), pages 359-374, January.
    11. Demeulemeester, Erik L. & Herroelen, Willy S., 1996. "Modelling setup times, process batches and transfer batches using activity network logic," European Journal of Operational Research, Elsevier, vol. 89(2), pages 355-365, March.
    12. Luh, Peter B. & Liu, Feng & Moser, Bryan, 1999. "Scheduling of design projects with uncertain number of iterations," European Journal of Operational Research, Elsevier, vol. 113(3), pages 575-592, March.
    13. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    14. Dayal Madhukar & Verma, Sanjay, 2015. "Multi-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2015-03-25, Indian Institute of Management Ahmedabad, Research and Publication Department.
    15. 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.
    16. 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.
    17. Krüger, Doreen & Scholl, Armin, 2009. "A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times," European Journal of Operational Research, Elsevier, vol. 197(2), pages 492-508, September.
    18. 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.
    19. Jozefowska, Joanna & Weglarz, Jan, 1998. "On a methodology for discrete-continuous scheduling," European Journal of Operational Research, Elsevier, vol. 107(2), pages 338-353, June.
    20. Zahid, Taiba & Kühn, Mathias & Völker, Michael & Schmidt, Thorsten, 2015. "Investigation of Scheduling Techniques for Uncertain Conditions," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Blecker, Thorsten & Kersten, Wolfgang & Ringle, Christian M. (ed.), Operational Excellence in Logistics and Supply Chains: Optimization Methods, Data-driven Approaches and Security Insights. Proceedings of the Hamburg , volume 22, pages 171-202, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.

    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:wly:navres:v:37:y:1990:i:1:p:61-84. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.