Some approximate inspection policies for a system with imperfect inspections
Some aspects of balking and reneging in finite buffer queues
In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit closed...
Some aspects of balking and reneging in finite buffer queues
In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit closed...
Some estimations of system reliability with positively dependent survival times of critical paths
Some examples of non-monotonicities in a two-unit redundant system
A cold-standby redundant sytem with two identical units and one repair facility is considered. Units can be in three states: good , degraded , and failed . It is supposed that only the following state-transitions of a unit are possible: , , , . The paper deals with the comparison of some initial situations of the system and with a stochastical improvement of units (stochastical increase of time of work in state and/or stochastical decrease of times of repairs of the types and/or ) and...
Some performance measures for vacation models with a batch Markovian arrival process.
Some reflections on the renewal-theory paradox in queueing theory.
Some results on Bellman equations of optimal production control in a stochastic manufacturing system.
Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning
This paper studies scheduling problems which include a combination of nonlinear job deterioration and a time-dependent learning effect. We use past sequence dependent (p-s-d) setup times, which is first introduced by Koulamas and Kyparisis [Eur. J. Oper. Res.187 (2008) 1045–1049]. They considered a new form of setup times which depend on all already scheduled jobs from the current batch. Job deterioration and learning co-exist in various real life scheduling settings. By the effects of learning...
Some Shannon-McMillan approximation theorems for Markov chain field on the generalized Bethe tree.
Sorting and cost analysis of reworking items in rejected lots based on non-destructive variable sampling plan.
Spanning trees of locally finite graphs
Special issue: Stochastic Programming in EURO XXII in Prague
Stability of Nash equilibria in locational games
Stability of queueing network system with two stations and classes.
Stability of queueing networks.
Stability of retrial queues with versatile retrial policy.
Stability of scheduling with random processing times on one machine
We consider a strong NP-hard single-machine scheduling problem with deadlines and minimizing the total weight of late jobs on a single machine (). Processing times are deterministic values or random variables having Erlang distributions. For this problem we study the tolerance to random parameter changes for solutions constructed according to tabu search metaheuristics. We also present a measure (called stability) that allows an evaluation of the algorithm based on its resistance to random parameter...
Statistical analysis of weighted networks.
Statistical-learning control of multiple-delay systems with application to ATM networks
Congestion control in the ABR class of ATM network presents interesting challenges due to the presence of multiple uncertain delays. Recently, probabilistic methods and statistical learning theory have been shown to provide approximate solutions to challenging control problems. In this paper, using some recent results by the authors, an efficient statistical algorithm is used to design a robust, fixed-structure, controller for a high-speed communication network with multiple uncertain propagation...