The search session has expired. Please query the service again.
We deal with a logistic problem motivated by a case study from a company dealing with inland transportation of piece goods in regular cycles. The problem consists in transportation of goods among regional centres – hubs of a network. Demands on transportation are contained in a matrix of flows of goods between pairs of hubs. The transport is performed by vehicles covering the shipping demands and the task is to design a cyclical route and to place a depot for each vehicle. The route depot can be...
Este trabajo estudia el problema de la planificación de la producción en sistemas de fabricación multinivel, con un cuello de botella. El problema se ha abordado mediante una aproximación heurística, resolviendo el problema resultante empleando el método primal dual. El trabajo incluye un algoritmo para la selección sucesiva de los precios de los recursos que garanticen una mejora monótona hacia la solución óptima.
We describe an O.R. technique which plans the allotment of
time of the collaborators of a big company. The proposed method not only
considers the immediate profitability of the company, but also the
training of
the collaborators in order to guarantee the success of the company's
rising
generation. The proposed method uses a greedy approach and constitutes
therefore a simple and fast tool for decision makers. It has been
successfully
implemented in an important Swiss bank society.
In this paper a formulation for the fuzzy p-median model in a fuzzy environment is presented. The model allows to find optimal locations of p facilities and their related cost when data related to the node demands and the edge distances are imprecise and uncertain and also to know the degree of certainty of the solution. For the sake of illustration, the proposed model is applied in a reduced map of Kinshasa (Democratic Republic of Congo) obtaining results which are rather than realistic ones.
We deal here with a scheduling problem GPPCSP (Generalized Parallelism and Preemption Constrained Scheduling Problem) which is an extension of both the well-known Resource Constrained Scheduling Problem and the Scheduling Problem with Disjunctive Constraints. We first propose a reformulation of GPPCSP: according to it, solving GPPCSP means finding a vertex of the Feasible Vertex Subset of an Antichain Polyhedron. Next, we state several theoretical results related to this reformulation process and...
Currently displaying 21 –
40 of
73