Related papers: On the sojourn time of a batch in the $M^{[X]}/M/1…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
We introduce a multistable subordinator, which generalizes the stable subordinator to the case of time-varying stability index. This enables us to define a multifractional Poisson process. We study properties of these processes and…
In this study, we investigate a scheduling problem on identical machines in which jobs require initial setup before execution. We assume that an algorithm can dynamically form a batch (i.e., a collection of jobs to be processed together)…
We consider the problem of scheduling multiprocessor jobs to minimize the total completion time under the given energy budget. Each multiprocessor job requires more than one processor at the same moment of time. Processors may operate at…
We introduce and study a multiparameter version of the generalized counting process (GCP), where there is a possibility of finitely many arrivals simultaneously. We call it the multiparameter GCP. In a particular case, it is uniquely…
We study infinite-server queues in which the arrival process is a Cox process (or doubly stochastic Poisson process), of which the arrival rate is given by shot noise. A shot-noise rate emerges as a natural model, if the arrival rate tends…
IIn this paper, we consider an M^X/M/c queue with state-dependent control at idle time and catastrophes. Properties of the queues which terminate when the servers become idle are firstly studied. Recurrence, equilibrium distribution and…
We propose a generalization of the classical M/M/1 queue process. The resulting model is derived by applying fractional derivative operators to a system of difference-differential equations. This generalization includes both non-Markovian…
Recent studies indicate that in many situations service times are affected by the experienced queueing delay of the particular customer. This effect has been detected in different areas, such as health care, call centers and…
In the paper the rescaled occupation time fluctuation process of a certain empirical system is investigated. The system consists of particles evolving independently according to \alpha-stable motion in R^d, \alpha<d<2\alpha. The particles…
Work sharing and work stealing are two scheduling paradigms to redistribute work when performing distributed computations. In work sharing, processors attempt to migrate pending jobs to other processors in the hope of reducing response…
We introduce a numerical tensor-network method to compute the statistics of the charge transferred across an interface partitioning an interacting one-dimensional many-body lattice system with $U(1)$ symmetry. Our approach is based on a…
In this paper we present multivariate space-time fractional Poisson processes by considering common random time-changes of a (finite-dimensional) vector of independent classical (non-fractional) Poisson processes. In some cases we also…
We consider a discrete population of users with homogeneous service demand who need to decide when to arrive to a system in which the service rate deteriorates linearly with the number of users in the system. The users have heterogeneous…
This paper studies a generalized busy-time scheduling model on heterogeneous machines. The input to the model includes a set of jobs and a set of machine types. Each job has a size and a time interval during which it should be processed.…
A two-class Processor-Sharing queue with one impatient class is studied. Local exponential decay rates for its stationary distribution (N, M) are established in the heavy traffic regime where the arrival rate of impatient customers grows…
We introduce the first class of perfect sampling algorithms for the steady-state distribution of multi-server queues with general interarrival time and service time distributions. Our algorithm is built on the classical dominated coupling…
We consider a problem of scheduling rigid parallel jobs on variable speed processors so as to minimize the total energy consumption. Each job is specified by its processing volume and the required number of processors. We propose new…
The problem of exact evaluation of the mean service cycle time in tandem systems of single-server queues with both infinite and finite buffers is considered. It is assumed that the interarrival and service times of customers form sequences…
We study a time-changed variant of the Erlang queue by taking the first hitting time of a mixed stable subordinator as the time-changing component. We call it the mixed time-changed Erlang queue. We derive the system of fractional…