Economic analysis of production bottlenecks.
Economic assessment of the Champagne wine qualitative stock mecanism
In the wine AOC system, the regulation of quantities performed by the professional organizations is aimed to smooth the variations of the quality of the wine due to the variations in the climate that affect the quality of the grapes. Nevertheless, this regulation could be damaging to the consumers due to the price increase resulting from the reduction of the quantities sold on the market. We propose a stochastic control model and a simulation tool able to measure the effects of this mechanism...
Economic Production Quantity Concerning Learning and the Reworking of Imperfect Items
Economically Optimal C-Control Charts
Economically Optimum Design of Cusum Charts to Control Normal Means
Editorial
Editorial. A case of plagiarism: retraction of a paper by Sreenivas and Srinivas, Vol. 43, n°4, pp. 331–337
Effective utilization of idle time in an inventory with positive service time.
Effects of the Application of Conventional Methods in the Process of Forming the Pick-Up Trains
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...
Efficient and local efficient solutions for assignment type problems
In this paper, we analyse the multiobjective problem generated by applying a goal programming approach to deal with linear assignment type problem. We specify sufficient conditions for a solution to be efficient for this problem. The notion of efficiency with respect to a neighborhood is also introduced and characterized through sufficient conditions. Unfortunately, these conditions are not necessary in general.
Efficient and Local Efficient Solutions for Assignment Type Problems
In this paper, we analyse the multiobjective problem generated by applying a goal programming approach to deal with linear assignment type problem. We specify sufficient conditions for a solution to be efficient for this problem. The notion of efficiency with respect to a neighborhood is also introduced and characterized through sufficient conditions. Unfortunately, these conditions are not necessary in general.
Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics.
Efficient offline algorithmic techniques for several packet routing problems in distributed systems.
Eigenspace of a circulant max–min matrix
The eigenproblem of a circulant matrix in max-min algebra is investigated. Complete characterization of the eigenspace structure of a circulant matrix is given by describing all possible types of eigenvectors in detail.
Eigenvalues and the max-cut problem
Ein Beitrag zur Suche der Extremstelle einer strikt unimodalen Funktion.
Eine Modifikation des Palmschen Modells für grosse Mehrmaschinenbedienungssysteme
El conjunto eficiente en problemas de localización con normas mixtas (Lp).
En el presente trabajo establecemos una nueva aproximación a la solución del problema de localización con normas mixtas a través de las direcciones de proyección.Probamos que el cierre octogonal de los puntos de demanda es una buena aproximación para el conjunto de puntos eficientes cuando el problema está formulado como un problema multiobjetivo con normas mixtas tipo lp. Demostramos que esta cota es alcanzable, dando condiciones para que ello ocurra, lo que es de gran importancia para el caso...
El criterio del valor esperado en un modelo de localización industrial.
En este trabajo consideramos el problema de localización de un centro de servicio o actividad industrial, cuando la localización de los puntos de demanda Pi, i = 1, 2, ..., n, viene dada por variables aleatorias (Xi,Yi) independientes, con distribuciones de probabilidad continuas. Utilizando el criterio del valor esperado, obtenemos la localización óptima del centro de servicio y calculamos el valor esperado de la información perfecta.