Displaying 41 – 60 of 172

Showing per page

Performance analysis of single server non-markovian retrial queue with working vacation and constant retrial policy

V. Jailaxmi, R. Arumuganathan, M. Senthil Kumar (2014)

RAIRO - Operations Research - Recherche Opérationnelle

This paper analyses an M/G/1 retrial queue with working vacation and constant retrial policy. As soon as the system becomes empty, the server begins a working vacation. The server works with different service rates rather than completely stopping service during a vacation. We construct the mathematical model and derive the steady-state queue distribution of number of customer in the retrial group. The effects of various performance measures are derived.

Periodic coordination in hierarchical air defence systems

Piotr Arabas, Krzysztof Malinowski (2001)

International Journal of Applied Mathematics and Computer Science

The subject of this work is the defence planning of a point target against an air attack. The defence system is decomposed into a number of sectors. A direct method of coordination is used at the upper level, while the sectors use a discrete-time event-based model and the description of uncertainty by multiple scenarios of an attack. The resulting problems are solved using linear programming. A comparison of two coordination strategies for realistic attack scenarios and an analysis of effectiveness...

Pickup and delivery problem with split demand and transfers

Jan Pelikán (2013)

Kybernetika

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

Piecewise-polynomial signal segmentation using convex optimization

Pavel Rajmic, Michaela Novosadová, Marie Daňková (2017)

Kybernetika

A method is presented for segmenting one-dimensional signal whose independent segments are modeled as polynomials, and which is corrupted by additive noise. The method is based on sparse modeling, the main part is formulated as a convex optimization problem and is solved by a proximal splitting algorithm. We perform experiments on simulated and real data and show that the method is capable of reliably finding breakpoints in the signal, but requires careful tuning of the regularization parameters...

Planificación multinivel con limitaciones de capacidad.

Sebastián Lozano Segura, Juan Carlos Larrañeta Astola, Luis Onieva Jiménez (1991)

Qüestiió

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.

Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise

Alain Hertz, Vincent Robert, Vincent Berthod (2010)

RAIRO - Operations Research

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.

Currently displaying 41 – 60 of 172