Displaying 1041 – 1060 of 1566

Showing per page

Optimal control for a BMAP/SM/1 queue with MAP-input of disasters and two operation modes

Olga V. Semenova (2004)

RAIRO - Operations Research - Recherche Opérationnelle

A single-server queueing system with a batch markovian arrival process (BMAP) and MAP-input of disasters causing all customers to leave the system instantaneously is considered. The system has two operation modes, which depend on the current queue length. The embedded and arbitrary time stationary queue length distribution has been derived and the optimal control threshold strategy has been determined.

Optimal control for a BMAP/SM/1 queue with MAP-input of disasters and two operation modes

Olga V. Semenova (2010)

RAIRO - Operations Research

A single-server queueing system with a batch Markovian arrival process (BMAP) and MAP-input of disasters causing all customers to leave the system instantaneously is considered. The system has two operation modes, which depend on the current queue length. The embedded and arbitrary time stationary queue length distribution has been derived and the optimal control threshold strategy has been determined.

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...

Optimal networks for mass transportation problems

Alessio Brancolini, Giuseppe Buttazzo (2005)

ESAIM: Control, Optimisation and Calculus of Variations

In the framework of transport theory, we are interested in the following optimization problem: given the distributions μ + of working people and μ - of their working places in an urban area, build a transportation network (such as a railway or an underground system) which minimizes a functional depending on the geometry of the network through a particular cost function. The functional is defined as the Wasserstein distance of μ + from μ - with respect to a metric which depends on the transportation network....

Optimal networks for mass transportation problems

Alessio Brancolini, Giuseppe Buttazzo (2010)

ESAIM: Control, Optimisation and Calculus of Variations

In the framework of transport theory, we are interested in the following optimization problem: given the distributions µ+ of working people and µ- of their working places in an urban area, build a transportation network (such as a railway or an underground system) which minimizes a functional depending on the geometry of the network through a particular cost function. The functional is defined as the Wasserstein distance of µ+ from µ- with respect to a metric which depends on the transportation...

Currently displaying 1041 – 1060 of 1566