Paper Info
Title
Network DEA: Additive efficiency decomposition
Abstract
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.
Year
DOI
Venue
2010
10.1016/j.ejor.2010.05.006
European Journal of Operational Research
Keywords
Field
DocType
DEA,Multistage,Serial systems,Additive decomposition
Black box (phreaking),Data modeling,Mathematical optimization,Weighting,Scheduling (production processes),Input/output,Data envelopment analysis,Supply chain,Open system (systems theory),Mathematics,Operations management
Journal
Volume
Issue
ISSN
207
2
0377-2217
Citations 
PageRank 
References 
71
2.07
6
Authors
4
Name
Order
Citations
PageRank
Wade D. Cook1121584.70
Joe Zhu21762167.31
Gong-bing Bi316916.90
F. Yang448945.25