Robustness-based discrete time/cost trade-off project scheduling

Zhang Jing-we · Computer Integrated Manufacturing Systems · 2013

Aiming at the problem that the duration fluctuations of activities were almost ignored in the classic Discrete Time/Cost Trade-off Project(DTCTP)scheduling,the flexibility of scheduling scheme was adjusted from the perspective of robust optimization.A new bi-objective model-DTCTP-Robustness based on project duration and robustness was presented by expanding the DTCTP-P2(budget problem),and a special exact enumeration sorting algorithm was developed to solve the DTCTP-Robustness,in which all feasible solutions were checked one by one,and the strategy for the bi-objective model was executed to preserve and update the Pareto solutions set.Through the solving example,the Pareto optimal solution sets were analyzed according to five combinations of project duration and robust measures under the different cost constraints.The difference between the optimal solution of DTCTPRobustness and DTCTP-P2models were contrasted within the same budget constraint.The conclusion showed that the DTCTP-P2could provide more objective information than the DTCTP-P2when project managers made the duration/cost trade-off of projects under the uncertain environment.

Read the paper · More papers on PaperTik