Displaying 81 – 100 of 143

Showing per page

Modelización de un DSS para la gestión de productos perecederos.

Belarmino Díaz Fernández, Jesús Angel del Brío González, B. González Torre (2001)

Qüestiió

La gestión de inventarios de productos perecederos ha atraído desde hace tiempo la atención de los investigadores de Dirección de Operaciones. En este artículo se presenta la modelización e implementación de un sistema de apoyo a la toma de decisiones (DSS) para la gestión de productos perecederos, aplicado a la distribución interhospitalaria de hemoderivados. En estos casos se trata de satisfacer en lo posible las demandas, tratando de evitar a la vez la caducidad de los productos en manos de los...

MOPP-I: an optimization package for multipurpose batch operations.

M. Lázaro, Antonio Espuña Camarasa, Lluís Puigjaner Corbella (1989)

Qüestiió

A number of algorithms have been developed -including enumeration of feasible production sequences, alternative task selection and the generation of alternative production lines- to determine the optimal sequence in which products and by-products should be produced and the times at which the various production operations for each product should be carried out to meet a given product demand pattern, taking into account the available equipment, storage costs, stopover penalties and other plant limitations.Product...

New algorithms for coupled tasks scheduling – a survey

Jacek Blazewicz, Grzegorz Pawlak, Michal Tanas, Wojciech Wojciechowicz (2012)

RAIRO - Operations Research - Recherche Opérationnelle

The coupled tasks scheduling problem is a class of scheduling problems introduced for beam steering software of sophisticated radar devices, called phased arrays. Due to increasing popularity of such radars, the importance of coupled tasks scheduling is constantly growing. Unfortunately, most of the coupled tasks problems are NP-hard, and only a few practically usable algorithms for such problems were found. This paper provides a survey of already known complexity results of various variants of...

On improving a solution to the ATSP with fixed origin and precedence relationships.

Laureano F. Escudero (1988)

Trabajos de Investigación Operativa

Given the directed graph G1 = (N, A1) with a node origin and a penalty matrix C, the ATSP with fixed origin and precedence relationships (hereafter, ASTP-PR) consists of finding the permutation of the nodes from the set N, such that it minimizes a matrix C based function and does not violate the precedence relationships given by the set A1. In this work we present an algorithm for improving a given feasible solution to the problem, by performing a local search that uses 3- and 4-change based procedures....

On modelling planning under uncertainty in manufacturing.

A. Alonso-Ayuso, L. F. Escudero, M.T. Ortuño (2007)

SORT

We present a modelling framework for two-stage and multi-stage mixed 0-1 problems under uncertainty for strategic Supply Chain Management, tactical production planning and operations assignment and scheduling. A scenario tree based scheme is used to represent the uncertainty. We present the Deterministic Equivalent Model of the stochastic mixed 0-1 programs with complete recourse that we study. The constraints are modelled by compact and splitting variable representations via scenarios.

Currently displaying 81 – 100 of 143