An Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks

Authors

  • Aghaie
  • Asl Haddad
  • Morovatdar
  • Roghanian
Abstract:

  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 possibly critical paths of interval-valued project networks. The proposed algorithm considers interactivity among paths which has not been yet considered in the fuzzy project scheduling literature. The extension of the proposed algorithm to the fuzzy network calculates criticality degrees of activities and paths of projects without any need to enumerate all project paths. Although algorithms for calculating criticality degrees in fuzzy networks have been previously proposed, despite the fact that they mostly consider a specific type of fuzzy numbers as activity duration times, the exiting algorithms do not discriminate possibly critical paths before calculating the criticality degrees. The computational experience on a series of well-known project samples confirms the algorithm to be remarkably more efficient than similar algorithms for fuzzy networks.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

fault location in power distribution networks using matching algorithm

چکیده رساله/پایان نامه : تاکنون روش‏های متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روش‏ها در شبکه توزیع به دلایلی همچون وجود انشعاب‏های متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تک‏فاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...

Analysis of critical paths in a project network with random fuzzy activity times

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...

full text

An Extension to Imprecise Data Envelopment Analysis

The standard data envelopment analysis (DEA) method assumes that the values for inputs and outputs are exact. While DEA assumes exact data, the existing imprecise DEA (IDEA) assumes that the values for some inputs and outputs are only known to lie within bounded intervals, and other data are known only up to an order. In many real applications of DEA, there are cases in which some of the input ...

full text

analysis of critical paths in a project network with random fuzzy activity times

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...

full text

An Algorithm to Compute Collusion Paths

In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting from their initial knowledge, and have presented a complete solution for a special case of the problem. In this paper we present an algorithm that solves the general case. Given a collusion problem the algorithm deter...

full text

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 4  issue None

pages  39- 54

publication date 2013-05

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023