Economic analysis of production bottlenecks.
Editorial
Efficiency evaluation of closed-loop supply chains with proportional dual-role measures
Data Envelopment Analysis (DEA) is a beneficial mathematical programming method to measure relative efficiencies. In conventional DEA models, Decision Making Units (DMUs) are usually considered as black boxes. Also, the efficiency of DMUs is evaluated in the presence of the specified inputs and outputs. Nevertheless, in real-world applications, there are situations in which the performance of multi-stage processes like supply chains with forward and reverse flows must be measured such that some...
Equivalence class in the set of fuzzy numbers and its application in decision-making problems.
Estimating the supply chain efficiency loss when the seller has to estimate the buyer’s willingness to pay
We study the pricing problem between two firms when the manufacturer’s willingness to pay (wtp) for the supplier’s good is not known by the latter. We demonstrate that it is in the interest of the manufacturer to hide this information from the supplier. The precision of the information available to the supplier modifies the rent distribution. The risk of opportunistic behaviour entails a loss of efficiency in the supply chain. The model is extended to the case of a supplier submitting offers to...
Evaluation of decision-making units based on the weight-optimized DEA model
Data envelopment analysis (DEA) is a methodology for measuring best relative efficiencies of a group of peer decision-making units (DMUs) that take multiple inputs to produce multiple outputs. However, the traditional DEA model only aims to maximize the efficiency of the DMU under evaluation. This usually leads to very small weights (even zero weights) being assigned to some inputs or outputs. Correspondingly, these inputs or outputs have little or even no contribution to efficiency, which is unfair...
Experimental evaluation of a multiobjective linear programming software
Extension of reverse elimination method through a dynamic management of the tabu list
The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list. It is based on logical interdependencies between the solutions encountered during recent iterations of the search. REM provides both a necessary and sufficient condition to prevent cycling. The purpose of this paper is first to incorporate in REM a chronological order rule when cycling is unavoidable, thereby assuring the finite convergence of Tabu Search. Secondly, we correct a generalization of REM, the so-called...
Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List
The Reverse Elimination Method (REM) is a dynamic strategy for managing the tabu list. It is based on logical interdependencies between the solutions encountered during recent iterations of the search. REM provides both a necessary and sufficient condition to prevent cycling. The purpose of this paper is first to incorporate in REM a chronological order rule when cycling is unavoidable, thereby assuring the finite convergence of Tabu Search. Secondly, we correct a generalization of REM, the so-called...