Loading [MathJax]/extensions/MathZoom.js
In this paper we consider the problem of scheduling, on a two-machine flowshop, a set of unit-time operations subject to time delays with respect to the makespan. This problem is known to be x1d4a9;x1d4ab; -hard in the strong sense. We propose an algorithm based on a branch and bound enumeration scheme. This algorithm includes the implementation of new lower and upper bound procedures, and dominance rules. A computer simulation to measure the performance of the algorithm is provided for a wide...
Data envelopment analysis (DEA) has been widely used to measure the performance of the operational units that convert multiple inputs into multiple outputs. In many real world scenarios, there are systems that have a two-stage network process with shared inputs used in both stages of productions. In this paper, the problem of evaluating the efficiency of a set of specialized and interdependent components that make up a large DMU is considered. In these processes the first stage consists of two parallel...
A Content Distribution Network (CDN) can be defined as an overlay system that replicates copies of contents at multiple points of a network, close to the final users, with the objective of improving data access. CDN technology is widely used for the distribution of large-sized contents, like in video streaming. In this paper we address the problem of finding the best server for each customer request in CDNs, in order to minimize the overall cost. We consider the problem as a transportation problem...
A real matrix A is said to be completely positive (CP) if it can be decomposed as A = BB^T, where the real matrix B has exclusively non-negative entries. Let k be the rank of A and Φ_k the least possible number of columns of the matrix B, the so-called completely positive rank (cp-rank) of A. The present work is devoted to a study of a general upper bound for the cp-rank of an arbitrary completely positive matrix A and its dependence on the ordinary rank k. This general upper bound of the cp-rank...
In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.
In this note, we present a slight modification of an algorithm for the
strict feasibility problem. This modification reduces
the number of iterations.
Fixed charge transportation problem (FCTP) is a supply chain problem. In this problem, in addition to the cost per unit for each transported product, a fixed cost is also required. The aim is to carry out the transportation process at the lowest possible cost. As with all supply chain problems, this problem may have one, two, or three stages. An algorithm that can find the optimal solution for the problem in polynomial time is not known, even if it is a single-stage problem. For this reason, new...
En este trabajo se estudian procedimientos para la elección entre las soluciones eficientes del Problema de Programación Lineal con Objetivos Múltiples, cuando el decisor manifiesta preferencias sobre ciertas ordenaciones de las valoraciones de las funciones objetivo, utilizándose como criterio de valoración global funciones basadas en el k-ésimo valor del vector de los objetivos ordenado en cada punto.Se desarrollan procedimientos para generar ordenaciones compatibles con la información del decisor....
Currently displaying 1 –
20 of
73