Page 1

Displaying 1 – 7 of 7

Showing per page

Flexible measures in production process: A DEA-based approach

Alireza Amirteimoori, Ali Emrouznejad (2011)

RAIRO - Operations Research

Data envelopment analysis (DEA) has been proven as an excellent data-oriented efficiency analysis method for comparing decision making units (DMUs) with multiple inputs and multiple outputs. In conventional DEA, it is assumed that the status of each measure is clearly known as either input or output. However, in some situations, a performance measure can play input role for some DMUs and output role for others. Cook and Zhu [Eur. J. Oper. Res.180 (2007) 692–699] referred to these variables...

Flexible measures in production process: A DEA-based approach

Alireza Amirteimoori, Ali Emrouznejad (2011)

RAIRO - Operations Research

Data envelopment analysis (DEA) has been proven as an excellent data-oriented efficiency analysis method for comparing decision making units (DMUs) with multiple inputs and multiple outputs. In conventional DEA, it is assumed that the status of each measure is clearly known as either input or output. However, in some situations, a performance measure can play input role for some DMUs and output role for others. Cook and Zhu [Eur. J. Oper. Res.180 (2007) 692–699] referred to these variables...

Forecast horizon and planning horizon paths in time-indexed network

Stanisław Bylka (2006)

Banach Center Publications

The problem of existence of a forecast (or planning) horizon has been considered in many special models, more or less precisely. We specify and investigate this problem for families of cheapest paths in networks with weakly ordered nodes. In a discrete network, the standard forward algorithm finds the subnetwork generated by optimal paths. The proposed forward procedure reduces subnetworks such that the forecast horizon remains unchanged. Based on the final subnetwork, we have an answer to the forecast...

France Telecom workforce scheduling problem: a challenge

Sebastian Pokutta, Gautier Stauffer (2009)

RAIRO - Operations Research

In this paper, we describe the methodology used to tackle France Telecom workforce scheduling problem (the subject of the Roadef Challenge 2007) and we report the results obtained on the different data sets provided for the competition. Since the problem at hand appears to be NP-hard and due to the high dimensions of the instance sets, we use a two-step heuristical approach. We first devise a problem-tailored heuristic that provides good feasible solutions and then we use a meta-heuristic scheme...

Currently displaying 1 – 7 of 7

Page 1