کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4959160 1445469 2017 28 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Negative data in DEA: Recognizing congestion and specifying the least and the most congested decision making units
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Negative data in DEA: Recognizing congestion and specifying the least and the most congested decision making units
چکیده انگلیسی
One of the important concepts of data envelopment analysis (DEA) is congestion. A decision making unit (DMU) has congestion if an increase (decrease) in one or more input(s) of the DMU leads to a decrease (increase) in one or more its output(s). The drawback of all existing congestion DEA approaches is that they are applicable only to technologies specified by non-negative data, whereas in the real world, it may exist negative data, too. Moreover, specifying the strongly and weakly most congested DMUs is a very important issue for decision makers, however, there is no study on specifying these DMUs in DEA. These two facts are motivations for creating this current study. Hence, in this research, we first introduce a DEA model to determine candidate DMUs for having congestion and then, a DEA approach is presented to detect congestion status of these DMUs. Likewise, we propose two integrated mixed integer programming (MIP)-DEA models to specify the strongly and weakly most congested DMUs. Note that the proposed approach permits the inputs and outputs that can take both negative and non-negative magnitudes. Also, a ranking DEA approach is introduced to rank the specified congested DMUs and identify the least congested DMU. Finally, a numerical example and an empirical application are presented to highlight the purpose of this research.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 79, March 2017, Pages 39-48
نویسندگان
, , ,