IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v13y2022i2d10.1007_s13198-021-01345-y.html
   My bibliography  Save this article

Critical chains and its randomness study for scheduling optimization

Author

Listed:
  • Xiaokang Han

    (Xi’an University of Architecture and Technology
    Hualu Engineering and Technology Co., Ltd)

  • Wenzhou Yan

    (Xi’an University of Architecture and Technology)

  • Ting Liu

    (Xi’an University of Architecture and Technology)

Abstract

Affected by various uncertain factors, the critical chain is random. The article studies the critical chain and its randomness, and points out that when there is no buffer, the critical chain method and the critical path method have the same identity, and the central limit law of the same distribution can solve the randomness of the critical chain. This conclusion is mainly based on the following research: (1) The paper analyze the technical points of the critical chain, and points out that the setting of the buffer can be replaced by the operation time of the process; (2) The principles and expressions are proposed for determining the critical chain; (3) The influence factors of the randomness of the critical chain are analyzed; (4) The randomness of the random critical chain is determined based on the central limit law of the same distribution.

Suggested Citation

  • Xiaokang Han & Wenzhou Yan & Ting Liu, 2022. "Critical chains and its randomness study for scheduling optimization," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(2), pages 844-854, April.
    • Handle: RePEc:spr:ijsaem:v:13:y:2022:i:2:d:10.1007_s13198-021-01345-y
    DOI: 10.1007/s13198-021-01345-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-021-01345-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-021-01345-y?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.

    References listed on IDEAS

    as
    1. James Burns & Qing Cao, 2011. "Deterministic, path-sensitive heuristics for project earned value management," International Journal of Project Organisation and Management, Inderscience Enterprises Ltd, vol. 3(1), pages 1-21.
    2. Giovanni Mazzuto & Maurizio Bevilacqua & Filippo E. Ciarapica, 2017. "A heuristic scheduling algorithm based on fuzzy logic and critical chain project management," International Journal of Project Organisation and Management, Inderscience Enterprises Ltd, vol. 9(4), pages 303-327.
    3. Xiaokang Han, 2021. "WBS-free scheduling method based on database relational model," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(3), pages 509-519, June.
    4. Hiroyuki Goto, 2017. "Forward-compatible framework with critical-chain project management using a max-plus linear representation," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 201-216, March.
    Full references (including those not matched with items on IDEAS)

    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. Preenithi Aksorn & Chotchai Charoenngam, 2016. "Factors influencing life cycle management for community infrastructure development," International Journal of Project Organisation and Management, Inderscience Enterprises Ltd, vol. 8(1), pages 63-86.

    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:spr:ijsaem:v:13:y:2022:i:2:d:10.1007_s13198-021-01345-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.