Article ID Journal Published Year Pages File Type
4959160 Computers & Operations Research 2017 28 Pages PDF
Abstract
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.
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, , ,