IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i2p458-470.html
   My bibliography  Save this article

A dynamic critical path method for project scheduling based on a generalised fuzzy similarity

Author

Listed:
  • Dajiang Liu
  • Changming Hu

Abstract

According to the project non-repeatability and their implementation environment uncertainty, this paper aims to propose a new fuzzy node labelling method. The method, with a dynamic perspective, quickly provides the effective solutions of the critical path and total duration for projects, and fully considers the fact that critical paths may change in a fuzzy environment. The proposed method incorporates the fuzzy concept into the dynamic idea, which improves the objectivity and “accuracy” of the analysis. Meanwhile, vector integration similarity algorithm (VISA) achieves multiple generalized trapezoidal fuzzy numbers ordering by integrating the norm and direction similarities of fuzzy vectors. VISA demonstrates its superiority by analyzing typical examples. Since there is no need to consider nodes that have no direct precedence relation with source nodes, this method is particularly suitable for quickly identifying the critical path of fuzzy project networks with multiple time parameters and complex precedence relation.

Suggested Citation

  • Dajiang Liu & Changming Hu, 2021. "A dynamic critical path method for project scheduling based on a generalised fuzzy similarity," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(2), pages 458-470, February.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:2:p:458-470
    DOI: 10.1080/01605682.2019.1671150
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2019.1671150
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2019.1671150?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:tjorxx:v:72:y:2021:i:2:p:458-470. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.