期刊名称:Journal of Technology Management and Business
印刷版ISSN:2289-7224
出版年度:2015
卷号:2
期号:2
语种:English
出版社:Universiti Tun Hussein Onn Malaysia (UTHM)
摘要:The linear bottleneck assignment problem (LBAP), which is a variation of the classical assignment problem, seeks to minimize the longest completion time rather than the sum of the completion times when a number of jobs are to be assigned to the same number of workers. If the completion times are not certain, then it is said to be a fuzzy LBAP. Here we propose a new algorithm to solve fuzzy LBAP with completion times as intuitionistic fuzzy numbers. Normal 0 false false false EN-US X-NONE X-NONE
其他摘要:The linear bottleneck assignment problem (LBAP), which is a variation of the classical assignment problem, seeks to minimize the longest completion time rather than the sum of the completion times when a number of jobs are to be assigned to the same number of workers. If the completion times are not certain, then it is said to be a fuzzy LBAP. Here we propose a new algorithm to solve fuzzy LBAP with completion times as intuitionistic fuzzy numbers. Normal 0 false false false EN-US X-NONE X-NONE
关键词:Fuzzy linear bottleneck assignment problem;Intuitionistic fuzzy numbers;Generalized trapezoidal intuitionistic fuzzy numbers;Ranking of fuzzy numbers.