On the distribution of the number of retrials

We consider queuing systems where customers are not allowed to queue, instead of that they make repeated attempts, or retrials, in order to enter service after some time. We obtain the distribution of the number of retrials produced by a tagged customer, until he finds an available server.     

Analysis of the manufacturing lead time in a production system with non-renewal batch input,threshold policy and post-operation

In this paper, we analyze the manufacturing lead time in a production system with BMAP (Batch Markovian Arrival process) input and post-operation operated under the N-policy. We use the factorization principle to derive the waiting time distribution (hence the manufacturing lead time) and the mean performance measures. A numerical example is provided.     

Waiting times of entangled electrons in normal–superconducting junctions

We consider a normal–superconducting junction in order to investigate the effect of new physical ingredients on waiting times. First, we study the interplay between Andreev and specular scattering at the interface on the distribution of waiting times of electrons or holes separately. In that case the distribution is not altered dramatically compared to the case of a single quantum channel with a quantum point contact since the interface acts as an Andreev mirror for holes. We then consider a fully entangled state originating from splitting of Cooper pairs at the interface and demonstrate a significant enhancement of the probability to detect two consecutive electrons in a short time interval. Finally, we discuss the electronic waiting time distribution in the more realistic situation of partial entanglement.     

Variable neighborhood search for minimum cost berth allocation

The berth allocation problem is to allocate space along the quayside to incoming ships at a container terminal in order to minimize some objective function. We consider minimization of total costs for waiting and handling as well as earliness or tardiness of completion, for all ships. We assume ships can arrive at any given time, i.e., before or after the berths become available. The resulting problem, which subsumes several previous ones, is expressed as a linear mixed 0–1 program. As it turns out to be too time-consuming for exact solution of instances of realistic size, a Variable Neighborhood Search (VNS) heuristic is proposed, and compared with Multi-Start (MS), a Genetic Search algorithm (GA) and a Memetic Search algorithm (MA). VNS provides optimal solutions for all instances solved to optimality in a previous paper of the first two authors and outperforms MS, MA and GA on large instances.     

Analysis of GI<Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>(<Emphasis Type="Italic">n</Emphasis>)//<Emphasis Type="Italic">N</Emphasis> systems with stochastic customer acceptance policy

We investigate GI ^X /M(n)//N systems with stochastic customer acceptance policy, function of the customer batch size and the number of customers in the system at its arrival. We address the time-dependent and long-run analysis of the number of customers in the system at prearrivals and postarrivals of batches and seen by customers at their arrival to the system, as well as customer blocking probabilities. These results are then used to derive the continuous-time long-run distribution of the number of customers in the system. Our analysis combines Markov chain embedding with uniformization and uses stochastic ordering as a way to bound the errors of the computed performance measures.      

多通道Assembly-like排队系统的强逼近

借助于强逼近理论和修正系统，本文较为详细地研究了多路到达、多服务台Ａｓｓｅｍｂｌｙ－ｌｉｋｅ排队系统，得到了队长过程、离去过程、负荷和虚等待时间过程的强逼近定理。     

Efficiency and welfare implications of managed public sector hospital waiting lists

A queuing model for public health service waiting lists is developed, and the implications for patient welfare of different systems for managing the waiting list are analysed. If patients are admitted to hospital on a first-come-first-served basis, a welfare gain is achieved by moving from a system of implicit to one of explicit rationing of access to the waiting list. If individual waiting times and hospital admissions are dependent on clinical priority, a further welfare gain is achievable without the use of explicit rationing, by reallocating the total waiting time from the more towards the less seriously ill. On efficiency and welfare criteria, a maximum waiting time guarantee does not appear to be a desirable development.     

Effects of time on the magnetic properties of terbium-doped LaMnO3

The magnetic properties of the perovskite form of LaMnO₃ have been shown strong interest in recent years due to its high potential for use in magnetic devices. In this paper, the magnetic properties of a 30% terbium-doped LaMnO₃ (LMTO) perovskite manganite synthesized by a conventional solid-state reaction were investigated. Data on these properties was recorded periodically via SQUID and VSM to reveal it to be best described magnetically as a spin glass system. Thus, the time effect must be taken into consideration in instantaneously determining this material’s spin glass state as well as the overall magnetic properties in the absence of a magnetic field. The results of this paper point to a more in-depth understanding of the change in magnetic properties associated with doped LaMnO₃.     

Logarithmic asymptotics for a single-server processing distinguishable sources

We consider a single-server first-in-first-out queue fed by a finite number of distinct sources of jobs. For a large class of short-range dependent and light-tailed distributed job processes, using functional large deviation techniques we prove a large deviation principle and logarithmic asymptotics for the joint waiting time and queue lengths distribution. We identify the paths that are most likely to lead to the rare events of large waiting times and long queue lengths. A number of examples are presented to illustrate salient features of the results.      

A combinatorial problem from sooner waiting time problems with run and frequency quotas

In this paper, we study the problem of finding the number of integer solutions solving