Network DEA: Additive efficiency decomposition
Network DEA: Additive efficiency decomposition
复制标题
网络 DEA：加性效率分解
DOI：
10.1016/j.ejor.2010.05.006
复制
发表时间：
2010-12-01
影响因子：
6.4
通讯作者：
Yang, Feng
中科院分区：
文献类型：
--
作者：
Cook, Wade D.;Zhu, Joe;Yang, Feng
在传统的DEA分析中，决策单元通常被视为一个黑箱，在这个意义上，内部结构被忽略，和一个决策单元的性能被假定为一组选定的输入和输出的函数。一个重要的机构的工作已经针对问题的设置，其中的DMU的特点是一个多阶段的过程，供应链和许多制造过程采取这种形式。最近的DEA文献系列过程往往集中在封闭系统，即从一个阶段的输出成为下一个阶段的输入，没有其他输入进入过程中的任何中间阶段。本文探讨了开放多阶段过程的更一般的问题。在这里，来自给定阶段的一些输出可以离开系统，而其他输出则成为下一阶段的输入。此外，新的投入可以在任何阶段进入。然后，我们扩展的方法来检查一般的网络结构。我们将这种结构的总体效率表示为构成该结构的各个组件或级的效率的加性加权平均值。因此，该模型不仅可以评估网络的整体性能，还可以表示该性能如何分解为网络各个组件的测量。我们使用两个数据集来说明该模型。(C)2010爱思唯尔有限公司版权所有。
In conventional DEA analysis, DMUs are generally treated as a black-box in the sense that internal structures are ignored, and the performance of a DMU is assumed to be a function of a set of chosen inputs and outputs. A significant body of work has been directed at problem settings where the DMU is characterized by a multistage process; supply chains and many manufacturing processes take this form. Recent DEA literature on serial processes has tended to concentrate on closed systems, that is, where the outputs from one stage become the inputs to the next stage, and where no other inputs enter the process at any intermediate stage. The current paper examines the more general problem of an open multistage process. Here, some outputs from a given stage may leave the system while others become inputs to the next stage. As well, new inputs can enter at any stage. We then extend the methodology to examine general network structures. We represent the overall efficiency of such a structure as an additive weighted average of the efficiencies of the individual components or stages that make up that structure. The model therefore allows one to evaluate not only the overall performance of the network, but as well represent how that performance decomposes into measures for the individual components of the network. We illustrate the model using two data sets. (C) 2010 Elsevier B.V. All rights reserved.