We developed a method for workforce scheduling that models both the structure of the set of permissible shifts, and the stochastic and time-varying demand process. A prototype implementation uses a genetic algorithm to search for good schedules, and evaluates the service level resulting from a...

Queueing systems with processor sharing represent the adequate models for sharing the resources, e.g., components of a computer or a bandwidth of communication systems. In this paper, we consider a queueing system with processor sharing discipline under quite general assumptions about the...

The phenomenon of overtaking in queueing systems and queueing networks has been addressed by several authors with various motivations in the last decades. Nevertheless, up to now, for the relatively simple M/M/2/FCFS queue, the distribution of the number of overtakes a stationary customer...

This paper studies a Markovian two-station tandem queueing network with impatient customers. Queueing networks with abandonment are common in many industries, e.g., call centers and healthcare. Therefore, their management has received much attention. The resulting model is a level-dependent...

Classical models of service systems with rational and strategic customers assume queues to be either fully visible or invisible. In practice, however, most queues are only "partially visible" or "opaque", in the sense that customers are not able to discern precise queue length upon arrival. This...

Markov model of multi-component machining system comprising two unreliable heterogeneous servers and mixed type of standby support has been studied. The repair job of broken down machines is done on the basis of bi-level threshold policy for the activation of the servers. The server returns back...