Page 1

Displaying 1 – 14 of 14

Showing per page

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.

Optimal lot size determination of multistage production system

Jindřich L. Klapka (1978)

Aplikace matematiky

This paper deals with the optimization of total setup plus inventory cost of a certain class of the multistage inventory-production systems with the series arranged production stages having generally different production rates, separated by stores from each other. The optimization is made by the choice of lot sizes across an infinite time horizon. The exact cost-optimization algorithm based on the Bellman optimality principle is derived and applied for deriving two lower bounds of the optimal cost...

Optimization of an SMD placement machine and flows in parametric networks

Katarína Cechlárová, Tamás Fleiner (2011)

Kybernetika

In the minimization of the number of subtours made by the insertion head of an SMD placement machine a variant of the network flow problem arose. In a network with n vertices and m arcs a set F of arcs (parametrized arcs) is given. The task is to find a flow of a given size such that the maximum of flow values along the arcs from F is minimized. This problem can be solved by a sequence of maximum flow computations in modified networks where the capacities of the parametrized arcs are successively...

Currently displaying 1 – 14 of 14

Page 1