How to Increase the Ability of a Student to Learn

An instructor is always challenged when covering the materials in a course (according to the syllabus) and at the same time making sure that all students have the opportunity to learn and understand the materials presented in the classroom. In this paper we will present some ideas and tools that enable one to try to achieve a balance. These are based on the author’s experience and perspective in teaching deterministic and stochastic operations research courses

Queueing Models with MAP Arrivals Useful in Service Sectors

Queueing models have found applications in many fields, notably in service sectors. In this paper, we study queueing models that have significant applications in service sectors. We look at multi-server systems with MAP arrivals. We assume phase type services for single server systems and exponential services when dealing with multi-server systems. All arriving customers finding no idle server will not wait in the system to receive services but rather leave their information in a registry list. These customers will be reached out on a first-come-first-served basis (FCFS) by an idle server soon after completing its current service. The reach out time is assumed to be exponential and at the end of this time, with a certain probability the reached out customer is available for service; with complementary probability the customer is not reachable due to various reasons including the customer not picking up the call from the service system to receive a service. In the case when the reach out is unsuccessful, the server will remain idle should there be no customer in the registry list. However, if there is at least one customer in the registry, then the server will start another reach out. The classical approach using matrix-analytic methods is employed and discuss a few illustrative examples that bring out the qualitative nature of the models in steady-state. When dealing with MAP/G/c queues we resort to simulation and present a few examples. Some concluding remarks including a few extensions to the models studied here are presented

Analysis of a Queueing Model with MAP Arrivals and Heterogeneous Phase-Type Group Services

Queueing models have proven to be very useful in real-life applications to enable the practitioners to optimize the limited resources to conduct their businesses as well as offer services efficiently. In general, we can group such applications into two sectors: manufacturing and service. These two sectors cover everything we deal with on a day-to-day basis. Queues in which the services are offered in blocks (or groups or batches) are well established in the literature and have a wide variety of applications in practice. In this paper, we look at one such queueing model in which the arrivals occur according to a Markovian arrival process and the services are offered in batches of varying sizes from 1 to a finite pre-determined constant, say, b. The service times are assumed to be of phase type with representation depending on the size of the group. Thus, the distributions considered are heterogeneous from both the representation and rate points of view. The model can be studied as a G I/M/1-type queue or as a QBD-model. The model is analyzed in steady state by establishing results including on the rate matrix and the waiting time distribution and providing a number of illustrative examples

Analysis of a multi-server queueing model with vacations and optional secondary services

In this paper we study a multi-server queueing model in which the customer arrive according to a Markovian arrival process. The customers may require, with a certain probability, an optional secondary service upon completion of a primary service. The secondary services are offered (in batches of varying size) when any of the following conditions holds good: (a) upon completion of a service a free server finds no primary customer waiting in the queue and there is at least one secondary customer (including possibly the primary customer becoming a secondary customer) waiting for service; (b) upon completion of a primary service, the customer requires a secondary service and at that time the number of customers needing a secondary service hits a pre-determined threshold value; (c) a server returning from a vacation finds no primary customer but at least one secondary customer waiting. The servers take vacation when there are no customers (either primary or secondary) waiting to receive service. The model is studied as a QBD-process using matrix-analytic methods and some illustrative examples arediscussed

A Retrial Queueing Model With Thresholds and Phase Type Retrial Times

There is an extensive literature on retrial queueing models. While a majority of the literature on retrial queueing models focuses on the retrial times to be exponentially distributed (so as to keep the state space to be of a reasonable size), a few papers deal with nonexponential retrial times but with some additional restrictions such as constant retrial rate, only the customer at the head of the retrial queue will attempt to capture a free server, 2-state phase type distribution, and finite retrial orbit. Generally, the retrial queueing models are analyzed as level-dependent queues and hence one has to use some type of a truncation method in performing the analysis of the model. In this paper we study a retrial queueing model with threshold-type policy for orbiting customers in the context of nonexponential retrial times. Using matrix-analytic methods we analyze the model and compare with the classical retrial queueing model through a few illustrative numerical examples. We also compare numerically our threshold retrial queueing model with a previously published retrial queueing model that uses a truncation method

Analysis of a k-out-of-N System with Spares, Repairs, and a Probabilistic Rule

We consider a k-out-of-N reliability system with identical components having exponential lifetimes. There is a single repairman who attends to failed components on a first comefirst-served basis. The repair times are assumed to be of phase type. The system has K spares that can be used according to a probabilistic rule to extend the lifetime of the system. The system is analyzed using Markov chain theory and some interesting results are obtained. A few illustrative numerical examples are discussed

MAP/PH/1 queueing model with working vacation and crowdsourcing

Crowdsourcing has been used in different domains such as healthcare, computer science, environmental sciences, business and marketing. However, only recently, queueing models useful in the context of crowdsourcing have been studied. These studies involve queueing models of the type M/M/c, MAP/PH/1, and MAP/PH/c. In this paper we introduce vacation and working vacation in the context of MAP/PH/1 with crowdsourcing and highlight the qualitative aspects of the model through illustrative examples

Two Parallel Finite Queues with Simultaneous Services and Markovian Arrivals

In this paper, we consider a finite capacity single server queueing model with two buffers, A and B, of sizes K and N respectively. Messages arrive one at a time according to a Markovian arrival process. Messages that arrive at buffer A are of a different type from the messages that arrive at buffer B. Messages are processed according to the following rules: 1. When buffer A(B) has a message and buffer B(A) is empty, then one message from A(B) is processed by the server. 2. When both buffers, A and B, have messages, then two messages, one from A and one from B, are processed simultaneously by the server. The service times are assumed to be exponentially distributed with parameters that may depend on the type of service. This queueing model is studied as a Markov process with a large state space and efficient algorithmic procedures for computing various system performance measures are given. Some numerical examples are discussed

Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues

Cloud computing is continuing to prove its flexibility and versatility in helping industries and businesses as well as academia as a way of providing needed computing capacity. As an important alternative to cloud computing, desktop grids allow to utilize the idle computer resources of an enterprise/community by means of distributed computing system, providing a more secure and controllable environment with lower operational expenses. Further, both cloud computing and desktop grids are meant to optimize limited resources and at the same time to decrease the expected latency for users. The crucial parameter for optimization both in cloud computing and in desktop grids is the level of redundancy (replication) for service requests/workunits. In this paper we study the optimal replication policies by considering three variations of Fork-Join systems in the context of a multi-server queueing system with a versatile point process for the arrivals. For services we consider phase type distributions as well as shifted exponential and Weibull. We use both analytical and simulation approach in our analysis and report some interesting qualitative results