Cost optimization analysis for an $$M^{X}/M/c$$ M X / M / c vacation queueing system with waiting servers and impatient customers

SeMA Journal ◽  
2018 ◽  
Vol 76 (2) ◽  
pp. 309-341 ◽  
Author(s):  
Amina Angelika Bouchentouf ◽  
Abdelhak Guendouzi
Keyword(s):  
Queueing System ◽  
Cost Optimization ◽  
Impatient Customers ◽  
Optimization Analysis

scholarly journals Efficiency Measurement of Maintenance Costs on Customer Service Process PT Indonesia Comnets Plus West Java

TRIKONOMIKA ◽  
2015 ◽  
Vol 14 (2) ◽  
pp. 138
Author(s):  
Ika Rizky Setyaningrum ◽  
Palti Marulitua Sitorus
Keyword(s):  
Information Technology ◽  
Customer Service ◽  
Preventive Maintenance ◽  
Cost Optimization ◽  
Optimization Analysis ◽  
West Java ◽  
Maintenance Costs ◽  
Analysis Techniques ◽  
Damage Probability ◽  
Optimal Period

Information technology is growing rapidly. The problems arising in the conjunction magnitude of information technology devices are how to manage, maintain, and calculate the amount of required investments. The purposes of this study are to measurepreventive and corrective cost optimization maintenance which determines the most optimal performance for alternative maintenance activity. The case studies in this research is PT Indonesia Comnets Plus (ICON +) West Java focusing on how the process of customer service telecommunication maintenance. Analysis techniques used are descriptive and optimization analysis. The level of corrective maintenance costs are known through services damage probability, average cost of service damage in the period of 2011-2014, and corrective cost analysis formula. To determine the level of preventive maintenance costs, it requires the calculation of damage probability screened estimated monthly service and then calculating the total cost of preventive maintenance. The analysis requires amount of damage and cost of protecting canceling services. The result, general implementation of maintenance services has been running well, but not optimal. Period of preventive maintenance services can be optimized with an average of 12-month treatment. 

scholarly journals Performance Analysis of Preemptive Priority Retrial Queueing System with Disaster under Working Breakdown Services

Symmetry ◽  
2019 ◽  
Vol 11 (3) ◽  
pp. 419 ◽  
Author(s):  
Sherif Ammar ◽  
Pakkirisamy Rajadurai
Keyword(s):  
Queueing System ◽  
Cost Optimization ◽  
System Size ◽  
Supplementary Variable ◽  
Preemptive Priority ◽  
Variable Technique ◽  
Retrial Queueing System ◽  
Retrial Queueing ◽  
Busy Server ◽  
The Impact

In this investigation, a novel sort of retrial queueing system with working breakdown services is introduced. Two distinct kinds of customers are considered, which are priority and ordinary customers. The normal busy server may become inadequate due to catastrophes at any time which cause the major server to fail. At a failure moment, the major server is sent to be fixed and the server functions at a lower speed (called the working breakdown period) during the repair period. The probability generating functions (PGF) of the system size is found using the concepts of the supplementary variable technique (SVT). The impact of parameters in system performance measures and cost optimization are examined numerically.

scholarly journals A Priority Queue with Many Customer Types, Correlated Arrivals and Changing Priorities

Mathematics ◽  
2020 ◽  
Vol 8 (8) ◽  
pp. 1292
Author(s):  
Seokjun Lee ◽  
Sergei Dudin ◽  
Olga Dudina ◽  
Chesoong Kim ◽  
Valentina Klimenok
Keyword(s):  
Markov Chain ◽  
Waiting Time ◽  
Performance Indicators ◽  
Queueing System ◽  
Priority Queue ◽  
First Aid ◽  
Single Server ◽  
Finite Buffer ◽  
Impatient Customers ◽  
Arrival Times

A single-server queueing system with a finite buffer, several types of impatient customers, and non-preemptive priorities is analyzed. The initial priority of a customer can increase during its waiting time in the queue. The behavior of the system is described by a multi-dimensional Markov chain. The generator of this chain, having essential dependencies between the components, is derived and formulas for computation of the most important performance indicators of the system are presented. The dependence of some of these indicators on the capacity of the buffer space is illustrated. The profound effect of the phenomenon of correlation of successive inter-arrival times and variance of the service time is numerically demonstrated. Results can be used for the optimization of dispatching various types of customers in information transmission systems, emergency departments and first aid stations, perishable foods supply chains, etc.

scholarly journals An inventory system for perishable commodities with random lifetime

1985 ◽  
Vol 17 (1) ◽  
pp. 234-236 ◽  
Author(s):  
David Perry
Keyword(s):  
Queueing System ◽  
Random Variable ◽  
Inventory System ◽  
Impatient Customers

In this study we assume an inventory system for perishable commodities in which the lifetimes of the items stored are i.i.d. random variable with finite mean.We utilize the analogy between this inventory system and a queueing system with impatient customers, to study the process of the lost demand, the death of the unused items and the number of items in the system.

A queueing system with impatient customers

1985 ◽  
Vol 22 (3) ◽  
pp. 688-696 ◽  
Author(s):  
A. G. De Kok ◽  
H. C. Tijms
Keyword(s):  
Performance Measures ◽  
Queueing System ◽  
Fixed Time ◽  
Single Server ◽  
Impatient Customers ◽  
Average Delay ◽  
Practical Applications ◽  
Poisson Input ◽  
General Service Times ◽  
General Service

A queueing situation often encountered in practice is that in which customers wait for service for a limited time only and leave the system if not served during that time. This paper considers a single-server queueing system with Poisson input and general service times, where a customer becomes a lost customer when his service has not begun within a fixed time after his arrival. For performance measures like the fraction of customers who are lost and the average delay in queue of a customer we obtain exact and approximate results that are useful for practical applications.

scholarly journals On a bulk queueing system with impatient customers

1998 ◽  
Vol 3 (6) ◽  
pp. 539-554 ◽  
Author(s):  
Lotfi Tadj ◽  
Lakdere Benkherouf ◽  
Lakhdar Aggoun
Keyword(s):  
Steady State ◽  
Queue Length ◽  
Queueing System ◽  
Impatient Customers ◽  
Ergodicity Condition ◽  
Bulk Service ◽  
Bulk Arrival ◽  
Steady State Probabilities ◽  
System Characteristics

We consider a bulk arrival, bulk service queueing system. Customers are served in batches ofrunits if the queue length is not less thanr. Otherwise, the server delays the service until the number of units in the queue reaches or exceeds levelr. We assume that unserved customers may get impatient and leave the system. An ergodicity condition and steady-state probabilities are derived. Various system characteristics are also computed.

Sign in / Sign up

Export Citation Format

Share Document