We consider the problem of on-line scheduling a set of n jobs on two parallel batch processing machines. Each machine can handle an infinite number of jobs as a batch simultaneously. The processing time of a batch is the time required for processing the longest job in the batch. Each job becomes available at its release date, which is not known in advance, and its processing time only becomes k...

Batch arrival and batch service queueing systems are of importance in the context telecommunication networks. None work reported so far consider dependence consecutive batches. Batch Markovian Arrival Process(\begin{document}$ BMAP $\end{document}) Service Process (\begin...

We perform an analysis of the transient delay in a discrete-time FIFO buffer with batch arrivals. As transient delay is an ambiguous concept, we first discuss different possible definitions of the term (delay of the k-th customer, delay of a customer arriving at time t, etc). In this paper, we focus on the analysis of the delay of a customer arriving in slot t, also sometimes called virtual del...

The discrete-time batch Markovian arrival process (D-BMAP) was first defined in [2]. The D-BMAP can represent a variety of arrival processes which include, as special cases, the Bernoulli arrival process, the Markov-modulated Bernoulli process (MMBP), the discrete-time Markovian arrival process (D-MAP), and their superpositions. It is the discrete-time version of the versatile Markovian point p...

In the past, many researchers have analysed queueing models with batch service. In such models, the server typically postpones service until the number of present customers reaches a service threshold, whereupon service is initiated of a batch consisting of several customers. In addition, correlation in the customer arrival process has been studied for many different queueing models. However, c...

In this paper a method is proposed called circulant matching method to approximate the superposition of a number of discrete time batch Markovian arrival sources by a circulant batch Markovian process while matching the stationary cumulative distribution and the autocorrelation sequence of the input rate process Special attention is paid to periodic sources The method is applied to the superpos...

Consider a two-stage matching problem, where edges of an input graph are revealed in two stages (batches) and in each stage we have to immediately and irrevocably extend our matching using the edges from that stage. The natural greedy algorithm is half competitive. Even though there is a huge literature on online matching in adversarial vertex arrival model, no positive results were previously ...