IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v13y1967i6pb359-b377.html
   My bibliography  Save this article

A Heuristic Model for Scheduling Large Projects with Limited Resources

Author

Listed:
  • Jerome D. Wiest

    (Graduate School of Business Administration, University of California, Los Angeles)

Abstract

Present PERT-type scheduling models implicitly assume unlimited availability of resources. As most project schedulers are aware, however, activities may be constrained in their start dates by availability of resources as well as by technological orderings. Analytic solutions to the limited-resource, project scheduling problem are infeasible at present for all but small projects; heuristic approaches seem most promising of useful results. One such approach, described here, is a computer model capable of scheduling single or multiple projects within resource limits and other constraints commonly encountered by the project scheduler. The basic formulation of the model is discussed along with its scheduling heuristics which determine the period-by-period allocation of resources to activities in a project. By changing certain parameters and heuristics in the model, one can simulate project scheduling under varying constraints and scheduling rules. Applications of the model to a number of fictitious and real projects are described.

Suggested Citation

  • Jerome D. Wiest, 1967. "A Heuristic Model for Scheduling Large Projects with Limited Resources," Management Science, INFORMS, vol. 13(6), pages 359-377, February.
  • Handle: RePEc:inm:ormnsc:v:13:y:1967:i:6:p:b359-b377
    DOI: 10.1287/mnsc.13.6.B359
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.13.6.B359
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.13.6.B359?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
    ---><---

    Citations

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


    Cited by:

    1. 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.
    2. Rainer Kolisch & Andreas Drexl, 1996. "Adaptive search for solving hard project scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(1), pages 23-40, February.
    3. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    4. 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.
    5. Yang, Kum-Khiong & Sum, Chee-Chuong, 1997. "An evaluation of due date, resource allocation, project release, and activity scheduling rules in a multiproject environment," European Journal of Operational Research, Elsevier, vol. 103(1), pages 139-154, November.
    6. Yaghoubi, Saeed & Noori, Siamak & Azaron, Amir & Fynes, Brian, 2015. "Resource allocation in multi-class dynamic PERT networks with finite capacity," European Journal of Operational Research, Elsevier, vol. 247(3), pages 879-894.
    7. 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.
    8. Hongbo Li & Zhe Xu & Wenchao Wei, 2018. "Bi-Objective Scheduling Optimization for Discrete Time/Cost Trade-Off in Projects," Sustainability, MDPI, vol. 10(8), pages 1-15, August.
    9. Kolisch, Rainer & Drexl, Andreas, 1994. "Hybrid biased random sampling for multiple resourse-constrained project scheduling problems," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 354, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. 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.
    11. Golenko-Ginzburg, Dimitri & Gonik, Aharon, 1997. "Stochastic network project scheduling with non-consumable limited resources," International Journal of Production Economics, Elsevier, vol. 48(1), pages 29-37, January.
    12. 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.
    13. Yaghoubi, Saeed & Noori, Siamak & Azaron, Amir & Tavakkoli-Moghaddam, Reza, 2011. "Resource allocation in dynamic PERT networks with finite capacity," European Journal of Operational Research, Elsevier, vol. 215(3), pages 670-678, December.
    14. 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.

    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:inm:ormnsc:v:13:y:1967:i:6:p:b359-b377. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.