z-logo
open-access-imgOpen Access
Possibilistic Distribution for Selection of Critical Path in Multi Objective Multi-Mode Problem with Trapezoidal Fuzzy Number
Author(s) -
Rekh Riddhi Ketankumar*,
Jayesh M. Dhodiya
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.d4372.118419
Subject(s) - critical path method , fuzzy number , vagueness , fuzzy logic , mathematical optimization , path (computing) , computer science , operations research , mode (computer interface) , membership function , frame (networking) , fuzzy set , mathematics , artificial intelligence , engineering , telecommunications , systems engineering , programming language , operating system
Execution of any project with optimum duration, cost, quality and risk is very significant for project administrators in recent very competitive commercial situation. Sometimes it is not possible to have detailed earlier statistics about project criteria. In such situations, estimation of different Decision makers are considered in linguistic variables and altered into triangular fuzzy numbers as fuzzy numbers have ability to deal with vagueness. In this paper, we frame a new multi-mode multi objective critical path problem and suggest a possibilistic methodology to find critical path for a project where three decision makers’ views are considered as three modes of execution in terms of linguistic variables. In this paper have formulated model of multiple mode in project network problem and find its solution with fuzzy programming approach with exponential membership and linear membership function. The proposed approach is useful to solve multi-mode project management problem which calculates optimal critical path according to four criteria- time, cost, risk and quality with three activities modes of execution in fuzzy environment

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here