Queue with Heterogeneous Server Under Resequencing Constraint

A Tandem Queue Model for Two-Server Resequencing System∗

A two-server resequencing system has two heterogeneous servers and two buffers. One is an arrival buffer, which holds incoming jobs waiting for service. The other is a resequencing buffer, which resequences served jobs back to their arrival orders before departure. Such a system can be modeled as a two-stage tandem queue where the jobs are always kept in the arrival orders but the servers swap ...

A Heterogeneous Arrival Queue under N Policy with Server Breakdowns and Multiple Vacations

We consider the problem of investment and consumption with a hidden Markov model and a regime switching structure. The Bayesian approach is followed to integrate econometric consideration and to make inference of the hidden Markov model. The optimal investment strategy is characterized by the method of stochastic dynamic programming and simulation results are given.

A Heterogeneous Arrival Queue under N Policy with Server Breakdowns and Multiple Vacations

Abstract: The cumulative damage of highly reliable products that subject to multiple loading stresses is investigated under Wiener process. Optimal strategies on the constant-stress accelerated degradation test plan are established to reach a compromised decision between the experiment budget and the estimation precision on the reliability inference. An algorithm is provided to search an optima...

Controllable Multi-Server Queue with Balking (TECHNICAL NOTE)

FINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION

A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.  

The Sojourn Time Distribution in an Infinite Server Resequencing Queue with Dependent Interarrival and Service Times

We consider an infinite server resequencing queue, where arrivals are generated by jumps of a semi-Markov process and service times depend on the jumps of this process. The stationary distribution of the sojourn time, conditioned on the state of the semi-Markov process, is obtained both for the case of hyperexponential service times and for the case of a Markovian arrival process. For the gener...