A Fuzzy Assignment Approach: Categorically for Selection Technique

Anju Khandelwal
{"title":"A Fuzzy Assignment Approach: Categorically for Selection Technique","authors":"Anju Khandelwal","doi":"10.29218/SRMSJOMS.V3I3.12954","DOIUrl":null,"url":null,"abstract":"The recruitment process in any departments or organizations is usually decided by\ntraditional criteria. Lacking of theoretical basis, it is often difficult to achieve the desired\nresult. In this paper we use triangular fuzzy number in delegation of recruitment process\nwith the help of modified approach of assignment. For finding the optimal assignment,\nwe make the balanced assignment problem, if unbalanced is given, then it is transformed\ninto crisp assignment problem in linear programming by using the Robust’s ranking\nmethod. Finally the solution is obtained by modified method of assignment. This method\nis easier than the existing technique i.e. easier than the Hungarian Method and by this\napproach the numbers of iterations are reduced so that time taken by this method is less\nthan the Hungarian method","PeriodicalId":340579,"journal":{"name":"SRMS Journal of Mathmetical Science","volume":"206 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SRMS Journal of Mathmetical Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29218/SRMSJOMS.V3I3.12954","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The recruitment process in any departments or organizations is usually decided by traditional criteria. Lacking of theoretical basis, it is often difficult to achieve the desired result. In this paper we use triangular fuzzy number in delegation of recruitment process with the help of modified approach of assignment. For finding the optimal assignment, we make the balanced assignment problem, if unbalanced is given, then it is transformed into crisp assignment problem in linear programming by using the Robust’s ranking method. Finally the solution is obtained by modified method of assignment. This method is easier than the existing technique i.e. easier than the Hungarian Method and by this approach the numbers of iterations are reduced so that time taken by this method is less than the Hungarian method
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种模糊分配方法:分类选择技术
任何部门或组织的招聘过程通常都是由传统标准决定的。由于缺乏理论依据,往往难以达到预期的效果。本文利用改进的分配方法,将三角模糊数应用于招聘过程的委托。为了寻找最优分配,我们提出了平衡分配问题,如果给定了不平衡,则利用鲁棒排序方法将其转化为线性规划中的清晰分配问题。最后利用改进的赋值法得到了该问题的解。该方法比现有技术更容易,即比匈牙利方法更容易,并且通过这种方法减少了迭代次数,因此该方法所花费的时间少于匈牙利方法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Comparative Study of Arithmetic Progression By Using Modern and Vedic Mathematics Fractional Order Neutral Mixed Integrodifferential Evolution Equations Software Reliability Growth Modeling Involving Burr Type XII distribution and Fault Removal Efficiency A review on Cloud Computing in Education 2-Divisor Lucky Labeling of some Identity Graphs of Finite Group and some Zero-Divisor Graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1