نتایج جستجو برای: project critical path problem
تعداد نتایج: 1630087 فیلتر نتایج به سال:
project planning is part of project management, which is relates to the use of schedules such as gantt charts to plan and subsequently report progress within the project environment. initially, the project scope is defined and the appropriate methods for completing the project are determined. in this paper a new approach for the critical path analyzing a project network with random fuzzy activi...
Project planning is part of project management, which is relates to the use of schedules such as Gantt charts to plan and subsequently report progress within the project environment. Initially, the project scope is defined and the appropriate methods for completing the project are determined. In this paper a new approach for the critical path analyzing a project network with random fuzzy activi...
In this paper Algorithm is presented to perform critical path method in a fuzzy environment. The trapezoidal fuzzy number given by decision makers or characterized by historical data are utilized to assess the activity time in a project network. The fuzzy shortest path problem thus obtained is compared with conventional method.
The task of finding the crisp critical path has received researcher’s attention over the past two decades which has wide range of applications in planning and scheduling the large projects. In most cases of our life, the data obtained for decision makers are only approximate, which gives rise to fuzzy critical path problem. In this paper, new ranking methods are introduced to identify the fuzzy...
In this paper, we propose a new approach to critical path analysis in a project network whose activity times are uncertain. The uncertain parameters in the project network are represented by fuzzy numbers. We use fuzzy arithmetic and a fuzzy ranking method to determine the fuzzy critical path of the project network without converting the fuzzy activity times to classical numbers. The proposed m...
We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...
the task of balancing of assembly lines is well-known in mass production system but this problem is np-hard even for the simple straight line. therefore, utilizing heuristic methods for these problems is totally unquestionable. furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...
Taking into account, the uncertain time duration for each activity in a pert network, we would need to accept the notion that the critical path of the project could also vary a number of times during its execution. If these variations take place frequently during the project in an unpredictable manner, it could endanger the efficient management of that project, and in addition to lengthening th...
In this study a new approach to rank exponential fuzzy numbers using -cuts is established. The metric distance of the interval numbers is extended to exponential fuzzy numbers. By using the ranking of exponential fuzzy numbers and using -cuts the critical path of a project network is solved and illustrated by numerical examples. Keywords: Exponential Fuzzy Numbers, -cuts, Metric Dista...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید