data envelopment analysis is a nonparametric technique checking efficiency of dmus using math programming. in conventional dea, it has been assumed that the status of each measure is clearly known as either input or output. kao and hwang (2008) developed a data envelopment analysis (dea) approach for measuring efficiency of decision processes which can be divided into two stages. the first stag...

data envelopment analysis (dea) is a method for measuring the efficiency of peer decision making units (dmus) which uses a set of inputs to produce a set of outputs. in some cases, dmus have a two-stage structure, in which the first stage utilizes inputs to produce outputs used as the inputs of the second stage to produce final outputs. one important issue in two-stage dea is the sensitivity of...

data envelopment analysis (dea) is a non-parametric approach for performance analysis of decision making units (dmus) which uses a set of inputs to produce a set of outputs without the need to consider internal operations of each unit. in recent years, there have been various studies dealt with two-stage production systems, i.e. systems which consume some inputs in their first stage to produce ...

the development of optimization and mathematical models for closed loop supply chain (clsc) design has attracted considerable interest over the past decades. however, the uncertainties that are inherent in the network design and the complex interactions among various uncertain parameters are challenging the capabilities of the developed tools. the aim of this paper, therefore, is to propose a n...

data envelopment analysis (dea) is a method for measuring the efficiency of peer decision making units (dmus) with multiple inputs and outputs. the traditional dea treats decision making units under evaluation as black boxes and calculates their efficiencies with first inputs and last outputs. this carries the notion of missing some intermediate measures in the process of changing the inputs to...

Motivated by the current research in data centers and cloud computing, we study the problem of scheduling a set of two-stage jobs on multiple two-stage flowshops. A new formulation for configurations of such scheduling is proposed, which leads directly to improvements to the complexity of scheduling algorithms for the problem. Motivated by the observation that the costs of the two stages can be...