The idea of linear Diophantine fuzzy set(LDFS)theory with its control parameters is a strong model for machine learning and optimization under uncertainty.The activity times in the critical path method(CPM)representat...The idea of linear Diophantine fuzzy set(LDFS)theory with its control parameters is a strong model for machine learning and optimization under uncertainty.The activity times in the critical path method(CPM)representation procedures approach are initially static,but in the Project Evaluation and Review Technique(PERT)approach,they are probabilistic.This study proposes a novel way of project review and assessment methodology for a project network in a linear Diophantine fuzzy(LDF)environment.The LDF expected task time,LDF variance,LDF critical path,and LDF total expected time for determining the project network are all computed using LDF numbers as the time of each activity in the project network.The primary premise of the LDF-PERT approach is to address ambiguities in project network activity timesmore simply than other approaches such as conventional PERT,Fuzzy PERT,and so on.The LDF-PERT is an efficient approach to analyzing symmetries in fuzzy control systems to seek an optimal decision.We also present a new approach for locating LDF-CPM in a project network with uncertain and erroneous activity timings.When the available resources and activity times are imprecise and unpredictable,this strategy can help decision-makers make better judgments in a project.A comparison analysis of the proposed technique with the existing techniques has also been discussed.The suggested techniques are demonstrated with two suitable numerical examples.展开更多
In this article, we investigate Programming Evaluation and Review Technique networks with independently and generally distributed activity durations. For any path in this network, we select all the activities related ...In this article, we investigate Programming Evaluation and Review Technique networks with independently and generally distributed activity durations. For any path in this network, we select all the activities related to this path such that the completion time of the sub-network （only consisting of all the related activities） is equal to the completion time of this path. We use the elapsed time as the supplementary variables and model this sub-network as a Markov skeleton process, the state space is related to the subnetwork structure. Then use the backward equation to compute the distribution of the sub-network＇s completion time, which is an important rule in project management and scheduling.展开更多
In the traditional methods of program evaluation and review technique （PERT） network optimization and compression of time limit for project, the uncertainty of free time difference and total time difference were not...In the traditional methods of program evaluation and review technique （PERT） network optimization and compression of time limit for project, the uncertainty of free time difference and total time difference were not considered as well as its time risk. The authors of this paper use the theory of dependent-chance programming to establish a new model about compression of time for project and multi-objective network optimization, which can overcome the shortages of traditional methods and realize the optimization of PERT network directly. By calculating an example with genetic algorithms, the following conclusions are drawn： （ 1 ） compression of time is restricted by cost ratio and completion probability of project; （2） activities with maximal standard difference of duration and minimal cost will be compressed in order of precedence; （3） there is no optimal solutions but noninferior solutions between chance and cost, and the most optimal node time depends on decision-maker＇s preference.展开更多
基金supported by the Deanship of Scientific Research,Vice Presidency for Graduate Studies and Scientific Research,King Faisal University,Saudi Arabia[Grant No.GRANT3862].
文摘The idea of linear Diophantine fuzzy set(LDFS)theory with its control parameters is a strong model for machine learning and optimization under uncertainty.The activity times in the critical path method(CPM)representation procedures approach are initially static,but in the Project Evaluation and Review Technique(PERT)approach,they are probabilistic.This study proposes a novel way of project review and assessment methodology for a project network in a linear Diophantine fuzzy(LDF)environment.The LDF expected task time,LDF variance,LDF critical path,and LDF total expected time for determining the project network are all computed using LDF numbers as the time of each activity in the project network.The primary premise of the LDF-PERT approach is to address ambiguities in project network activity timesmore simply than other approaches such as conventional PERT,Fuzzy PERT,and so on.The LDF-PERT is an efficient approach to analyzing symmetries in fuzzy control systems to seek an optimal decision.We also present a new approach for locating LDF-CPM in a project network with uncertain and erroneous activity timings.When the available resources and activity times are imprecise and unpredictable,this strategy can help decision-makers make better judgments in a project.A comparison analysis of the proposed technique with the existing techniques has also been discussed.The suggested techniques are demonstrated with two suitable numerical examples.
基金supported by the National Natural Science Foundation of China(10671212,10901164,90820302)the Graduate Research Innovation Projects in Hunan Province(CX2009B020)the Graduate Degree Thesis Innovation Foundation of Central Sourth University(2009ybfz11)
文摘In this article, we investigate Programming Evaluation and Review Technique networks with independently and generally distributed activity durations. For any path in this network, we select all the activities related to this path such that the completion time of the sub-network （only consisting of all the related activities） is equal to the completion time of this path. We use the elapsed time as the supplementary variables and model this sub-network as a Markov skeleton process, the state space is related to the subnetwork structure. Then use the backward equation to compute the distribution of the sub-network＇s completion time, which is an important rule in project management and scheduling.
文摘In the traditional methods of program evaluation and review technique （PERT） network optimization and compression of time limit for project, the uncertainty of free time difference and total time difference were not considered as well as its time risk. The authors of this paper use the theory of dependent-chance programming to establish a new model about compression of time for project and multi-objective network optimization, which can overcome the shortages of traditional methods and realize the optimization of PERT network directly. By calculating an example with genetic algorithms, the following conclusions are drawn： （ 1 ） compression of time is restricted by cost ratio and completion probability of project; （2） activities with maximal standard difference of duration and minimal cost will be compressed in order of precedence; （3） there is no optimal solutions but noninferior solutions between chance and cost, and the most optimal node time depends on decision-maker＇s preference.
