DEA as an effective approach to evaluate the relative efficiency of DMUs, recently applied in many production and operation systems. This paper proposed a new k-stage DEA based MOLP model for target setting in the serial network structures, considering undesirable outputs. Since the proposed model takes the size of DMUs into account, the new idea ensures the possibility of the results. The resu...

In this paper, a comprehensive mathematical model for designing an electric power supply chain network via considering preventive maintenance under risk of network failures is proposed. The risk of capacity disruption of the distribution network is handled via using a two-stage stochastic programming as a framework for modeling the optimization problem. An applied method of planning for the net...

The set of input-output permutations that are routable through a multistage interconnection network without any connict (known as the admissible set), plays an important role in determining the capability of the network. Recent works on the permutation admissibity problem of shuue-exchange networks (SEN) of size N N, deal with (n + k) stages, where n = log2N, and k denotes the number of extra s...

A generalization of the well-known shu f l e network i s proposed f o r multihop lightwave communication. In the classical definition of 4 shu f l e network, i.e., N = kpk where N i s the number of nodes and k i s the n u m ber of stages w i th base p , the realizable values of N are veay discrete and m a n y of the intermediate values of N are no t ,realizable. In this paper, we propose 4 new ...

many studies have been conducted to determine the efficiency of two-stage network structures in the recent years. the two-stage network with additional inputs to the second stage, in which the second stage is independent of the first stage are one of these structures. thus, there is a need for a model capable of calculating the efficiency of two-stage structures as well as efficiency of each st...

In this paper, we solve a longstanding open problem on the design of optimal rearrangeable networks. Networks such as the Benes [1] have been used for over 40 years, yet the uniform N(2 logN − 1) control complexity of the N × N Benes is not optimal for many permutations. To the best of our knowledge, there are no results in the literature that improve this control complexity. In this paper, we ...