This paper introduces the problem of optimally admitting a finite number of customers from an auxiliary buffer with a low holding cost into a single–server queue with a high holding cost without observing the status of the single-server queue. This paper formulates a static (off-line) optimization of the admission schedule for a finite number of customers, assuming that the single–server queue ...

In this paper the information theoretic principle of Maximum Entropy (ME) is applied, as a method of inference, towards the study of the M/G/1 queueing model at equilibrium with either single or multiple server vacation periods under both exhaustive and non-exhaustive scheduling schemes. An analytic ME approximation for the characterisation of a universal form for the queue length distribution ...

This short note discusses open problems and partial solutions related to Sheldon M Ross's second conjecture about the classical single server queue subject a randomly time-varying rate arrival rate.

Abstract In this work, we consider a novel single-server retrial queue with event-dependent arrival rates. Contrary to other related works, the primary customers’ rates depend on last realized event, which refers either departure, or an of type, when customer arrives during busy period, compared others. Our motivation stems from modeling service systems, in customers express their willingness j...