All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 6 Next

Displaying 101 – 120 of 190

Showing per page

On ƒ-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes

Ján Maňuch, Ladislav Stacho (2010)

RAIRO - Theoretical Informatics and Applications

Motivated by the wavelength division multiplexing in all-optical networks, we consider the problem of finding an optimal (with respect to the least possible number of wavelengths) set of ƒ+1 internally node disjoint dipaths connecting all pairs of distinct nodes in the binary r-dimensional hypercube, where 0 ≤ ƒ < r. This system of dipaths constitutes a routing protocol that remains functional in the presence of up to ƒ faults (of nodes and/or links). The problem of constructing such...

Online LIB problems : heuristics for bin covering and lower bounds for bin packing

Luke Finlay, Prabhu Manyem (2005)

RAIRO - Operations Research - Recherche Opérationnelle

We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced here. The...

Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing

Luke Finlay, Prabhu Manyem (2006)

RAIRO - Operations Research

We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the LIB version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced here. The...

Optimal and Near-Optimal (s,S) Inventory Policies for Levy Demand Processes

Robin O. Roundy, Gennady Samorodnitsky (2010)

RAIRO - Operations Research

A Levy jump process is a continuous-time, real-valued stochastic process which has independent and stationary increments, with no Brownian component. We study some of the fundamental properties of Levy jump processes and develop (s,S) inventory models for them. Of particular interest to us is the gamma-distributed Levy process, in which the demand that occurs in a fixed period of time has a gamma distribution. We study the relevant properties of these processes, and we develop a quadratically convergent...

Optimal control and performance analysis of an M X / M / 1 queue with batches of negative customers

Jesus R. Artalejo, Antonis Economou (2004)

RAIRO - Operations Research - Recherche Opérationnelle

We consider a Markov decision process for an M X / M / 1 queue that is controlled by batches of negative customers. More specifically, we derive conditions that imply threshold-type optimal policies, under either the total discounted cost criterion or the average cost criterion. The performance analysis of the model when it operates under a given threshold-type policy is also studied. We prove a stability condition and a complete stochastic comparison characterization for models operating under different...

Optimal control and performance analysis of an MX/M/1 queue with batches of negative customers

Jesus R. Artalejo, Antonis Economou (2010)

RAIRO - Operations Research

We consider a Markov decision process for an MX/M/1 queue that is controlled by batches of negative customers. More specifically, we derive conditions that imply threshold-type optimal policies, under either the total discounted cost criterion or the average cost criterion. The performance analysis of the model when it operates under a given threshold-type policy is also studied. We prove a stability condition and a complete stochastic comparison characterization for models operating under different...

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.

Currently displaying 101 – 120 of 190