P. Godhandaraman

Bio: P. Godhandaraman is an academic researcher from SRM University. The author has contributed to research in topics: Retrial queue & Tardiness. The author has an hindex of 5, co-authored 16 publications receiving 81 citations. Previous affiliations of P. Godhandaraman include Anna University.

Performance analysis of a single server retrial queue with working vacation

Abstract: This paper deals with a single server retrial queueing system with working vacation in which the server works with different service rates rather than completely terminating the service during its vacation period. We assume that both service times in a regular service period and in a working vacation period are generally distributed. The steady state distributions of the server state and the number of jobs in the orbit were obtained along with other performance measures. The general decomposition law for this retrial queueing system is established. The effects of various parameters on the system performance are also analyzed numerically.

Retrial queueing system with balking, optional service and vacation

Abstract: In this study, we propose a single server retrial queueing system with balking, second optional service and single vacation. At the arrival epoch, if the server is busy, the arriving job join the orbit or balks the system whereas if the server is free, then the arriving job starts its service immediately. For each job, the server provides two phases of service. All the jobs demand the first essential service, whereas only some of the jobs demand for the second optional service. If the system is empty, then the server becomes inactive and begins a single vacation. If server comes back from the vacation, it does not go for another vacation even if the system is still empty at that time. The steady state distributions of the server state and the number of jobs in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analyzed numerically. A general decomposition law for this retrial queueing system is established.

A Batch Arrival Retrial Queue with Two Phases of Service, Feedback and K Optional Vacations

Abstract: We consider a batch arrival queueing system with two phases of service, feedback and K optional vacations under a classical retrial policy. At the arrival epoch, if the server is busy the whole batch joins the orbit. Whereas if the server is free, then one of the arriving customer starts its service immediately and the rest joins the orbit. For each customer, the server provides two phases of service. After the completion of two phases of service, the customer may rejoin the orbit as a feedback customer for receiving another regular service with probability p. If the system is empty, then the server become inactive and begins the first essential vacation. After the completion of first essential vacation, the server may either wait idle for a customer or may take one of K additional vacations. The steady state distribution of the server state and the number of customers in the orbit are obtained. Also the effects of various parameters on the system performance are analyzed numerically.

Unrelated parallel machine scheduling with multi-maintenance activities using CPLEX

Abstract: In this problem, an unrelated parallel machine with non-preemptive, job sequence, setup times and multi level of maintenance are considered. The multi level of maintenance activities are considered in each machine and the duration is based on the processing time for maintenance. In advance, the maximum number of the maintenance frequencies is assumed on all the machines for the restriction of budget. The aim is to find the frequencies, positions and job sequences in maintenance for the total completion time. This model is motivated by a realistic application for cutting process such as wood and metal cutting. In this problem, we formulate the mixed integer programming for finding an optimal solution. The experimental study and the CPLEX were implemented to evaluate its performance in terms of solution quality.

A simulated annealing approach for the non-identical parallel batch processing machines to minimize total weighted tardiness

Abstract: This paper discussed with a Simulated Annealing approach to minimize the total lateness for the non identical parallel machines with batch processing. Each job is grouped into a batch and every batch under the capacity of the machine. The capacities of the machines are non identical. If the processing of a batch is started, then the additional jobs are not allowed to introduce or remove from the batch and it cannot be stopped prematurely. In company, the objective is to reduce the total penalty incurred for late deliveries. That is, to minimize the total weighted tardiness. This model is motivated by a realistic application in an electronics manufacturing and testing facility. In this problem, we formulate the mixed integer programming for finding an optimal solution. The experimental study and the Simulated Annealing were implemented to evaluate its performance in terms of solution quality and run time.

Fundamentals of Queueing Theory

Abstract: Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

A study on M/G/1 feedback retrial queue with subject to server breakdown and repair under multiple working vacation policy

Abstract: In this paper, we consider a single server feedback retrial queueing system with multiple working vacations and vacation interruption. An arriving customer may balk the system at some particular times. As soon as orbit becomes empty at regular service completion instant, the server goes for a working vacation. The server works at a lower service rate during working vacation (WV) period. After completion of regular service, the unsatisfied customer may rejoin into the orbit to get another service as feedback customer. The normal busy server may get to breakdown and the service channel will fail for a short interval of time. The steady state probability generating function for the system size is obtained by using the supplementary variable method. Some important system performance measures are obtained. Finally, some numerical examples and cost optimization analysis are presented.

Retrial queueing system with balking, optional service and vacation

Abstract: In this study, we propose a single server retrial queueing system with balking, second optional service and single vacation. At the arrival epoch, if the server is busy, the arriving job join the orbit or balks the system whereas if the server is free, then the arriving job starts its service immediately. For each job, the server provides two phases of service. All the jobs demand the first essential service, whereas only some of the jobs demand for the second optional service. If the system is empty, then the server becomes inactive and begins a single vacation. If server comes back from the vacation, it does not go for another vacation even if the system is still empty at that time. The steady state distributions of the server state and the number of jobs in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analyzed numerically. A general decomposition law for this retrial queueing system is established.

M/M/c balking retrial queue with vacation

Abstract: This paper deals with an M/M/c balking retrial queue with vacation. Both single and multiple vacation policies are analysed. This system is investigated as a quasi-birth-and-death process. Using the matrix-geometric method, we derive the useful formulae for computing the rate matrix and stationary probabilities. Various system performance measures are further developed in the matrix-form expressions. We construct a cost function to determine the optimum value of servers and the optimum mean service rate subject to the stability condition at minimum cost. Quasi-Newton method, Nelder–Mead simplex method and simulated annealing method are employed to perform the optimization tasks. Under optimum operating conditions, we provide the numerical results for a comparison of vacation policies. An application example is given to illustrate the system’s potential applicability.