2型模糊数的不同距离关键路径

V.Anusuya, P.Balasowandari
{"title":"2型模糊数的不同距离关键路径","authors":"V.Anusuya, P.Balasowandari","doi":"10.22457/ijfma.v13n1a1","DOIUrl":null,"url":null,"abstract":"The critical path method (CPM) is a vital tool for planning and controlling complex projects. The successful implementation of CPM requires the availability of clear determined time duration for each activity. In practical situations this requirement is usually hard to fulfill, since many of these activities are uncertain, which leads to the development of fuzzy critical path method. In this paper, we propose a new approach to find critical path and its path length using some various distances of trapezoidal type-2 fuzzy numbers. An example is included to demonstrate our proposed approach.","PeriodicalId":385922,"journal":{"name":"International Journal of Fuzzy Mathematical Archive","volume":"111 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Critical Path with Various Distances of Type-2 Fuzzy Numbers\",\"authors\":\"V.Anusuya, P.Balasowandari\",\"doi\":\"10.22457/ijfma.v13n1a1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The critical path method (CPM) is a vital tool for planning and controlling complex projects. The successful implementation of CPM requires the availability of clear determined time duration for each activity. In practical situations this requirement is usually hard to fulfill, since many of these activities are uncertain, which leads to the development of fuzzy critical path method. In this paper, we propose a new approach to find critical path and its path length using some various distances of trapezoidal type-2 fuzzy numbers. An example is included to demonstrate our proposed approach.\",\"PeriodicalId\":385922,\"journal\":{\"name\":\"International Journal of Fuzzy Mathematical Archive\",\"volume\":\"111 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Fuzzy Mathematical Archive\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22457/ijfma.v13n1a1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Fuzzy Mathematical Archive","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22457/ijfma.v13n1a1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

关键路径法(CPM)是规划和控制复杂项目的重要工具。CPM的成功实施需要为每项活动提供明确确定的持续时间。在实际情况下,这一要求通常很难满足,因为许多这些活动是不确定的,这导致了模糊关键路径方法的发展。本文提出了一种利用梯形2型模糊数的不同距离求关键路径及其路径长度的新方法。通过一个示例来演示我们提出的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Critical Path with Various Distances of Type-2 Fuzzy Numbers
The critical path method (CPM) is a vital tool for planning and controlling complex projects. The successful implementation of CPM requires the availability of clear determined time duration for each activity. In practical situations this requirement is usually hard to fulfill, since many of these activities are uncertain, which leads to the development of fuzzy critical path method. In this paper, we propose a new approach to find critical path and its path length using some various distances of trapezoidal type-2 fuzzy numbers. An example is included to demonstrate our proposed approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信