• DocumentCode
    2966321
  • Title

    The 0-1 Programming Model for Solving Critical Path and its Sensitivity Analysis

  • Author

    Lianghai, Jin ; Bin, Tian ; Hougui, Zhou

  • Author_Institution
    Coll. of Hydraulic &Environ. Eng., China Three Gorges Univ., Yichang, China
  • Volume
    2
  • fYear
    2011
  • fDate
    28-29 March 2011
  • Firstpage
    1019
  • Lastpage
    1022
  • Abstract
    Critical path method (CPM) is a project network analysis techniques for one or more activity by analyzing the sequence (line) scheduling flexibility (the total float) at least to predict the duration. The traditional method solves earliest time through forward pass and latest time through backward pass, to determine the critical path. However, as for large-scale and complex projects, the traditional methods commits calculation of predecessor activity of maximal earliest start time and minimum follow-up to the latest start time to a great memory. Using 0-1 programming method Can be easily adapted to different sizes to establish critical path network plan and quickly solve the mathematical model, and then through the objective function of model sensitivity analysis, critical path change problem can be solved. Besides, the metod provide basic computer algorithm for the large-scale program of complex network.
  • Keywords
    critical path analysis; mathematical programming; planning; project management; scheduling; sensitivity analysis; 0-1 programming model; backward pass; complex project; computer algorithm; critical path method; forward pass; large-scale project; project network analysis techniques; sensitivity analysis; sequence scheduling; Analytical models; Computational modeling; Mathematical model; Planning; Programming; Sensitivity analysis; 0-1 programming; CPM; Changes; Sensiti vity analysis; network Planning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Computation Technology and Automation (ICICTA), 2011 International Conference on
  • Conference_Location
    Shenzhen, Guangdong
  • Print_ISBN
    978-1-61284-289-9
  • Type

    conf

  • DOI
    10.1109/ICICTA.2011.540
  • Filename
    5751065