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

Critical path analysis and resource constrained project scheduling -- Theory and practice

Author

Listed:
  • Willis, R. J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Willis, R. J., 1985. "Critical path analysis and resource constrained project scheduling -- Theory and practice," European Journal of Operational Research, Elsevier, vol. 21(2), pages 149-155, August.
    • Handle: RePEc:eee:ejores:v:21:y:1985:i:2:p:149-155
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(85)90026-8
    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.

    Citations

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


    Cited by:

    1. Golenko-Ginzburg, Dimitri & Gonik, Aharon & Laslo, Zohar, 2003. "Resource constrained scheduling simulation model for alternative stochastic network projects," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 63(2), pages 105-117.
    2. Rema Padman & Dwight E. Smith‐Daniels & Vicki L. Smith‐Daniels, 1997. "Heuristic scheduling of resource‐constrained projects with cash flows," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(4), pages 365-381, June.
    3. 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.
    4. 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.
    5. W Herroelen & R Leus, 2005. "Identification and illumination of popular misconceptions about project scheduling and time buffering in a resource-constrained environment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(1), pages 102-109, January.
    6. Golenko-Ginzburg, Dimitri & Gonik, Aharon, 1998. "A heuristic for network project scheduling with random activity durations depending on the resource allocation," International Journal of Production Economics, Elsevier, vol. 55(2), pages 149-162, July.
    7. Yang, Kum-Khiong, 1998. "A comparison of dispatching rules for executing a resource-constrained project with estimated activity durations," Omega, Elsevier, vol. 26(6), pages 729-738, December.

    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:21:y:1985:i:2:p:149-155. 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: 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.