General Mathematics


A Critical Path Problem Using Triangular Neutrosophic Number

Authors: Mai Mohamed, Mohamed Abdel-Baset, Yongquan Zhou, Florentin Smarandache

The Critical Path Method (CPM) is one of several related techniques for planning and managing of complicated projects in real world applications. In many situations, the data obtained for decision makers are only approximate, which gives rise of neutrosophic critical path problem. In this paper, the proposed method has been made to find the critical path in network diagram, whose activity time uncertain. The vague parameters in the network are represented by triangular neutrosophic numbers, instead of crisp numbers. At the end of paper, two illustrative examples are provided to validate the proposed approach.

Comments: 5 Pages.

Download: PDF

Submission history

[v1] 2017-09-14 02:17:17

Unique-IP document downloads: 17 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus