INFORMATION CHANGE THE WORLD

International Journal of Mathematical Sciences and Computing(IJMSC)

ISSN: 2310-9025 (Print), ISSN: 2310-9033 (Online)

Published By: MECS Press

IJMSC Vol.2, No.4, Nov. 2016

Comparative Analysis of Customers' Queue Management of First Bank Plc. and Guaranty Trust Bank Plc, Isokun Ilesa, Nigeria

Full Text (PDF, 590KB), PP.1-11


Views:59   Downloads:7

Author(s)

David O. Ikotun, Justus A. Ademuyiwa, Festus D. Famule

Index Terms

Queue theory;markovian birth process;channel;queue efficiency;probability;queue discipline;arrival rate

Abstract

Problem of queue management has been a great barrier to the financial institutions. Another way of measuring efficiency in banking industries is how fast the service of saving and withdraw is been rendered. Imagine customers that spend the whole day in the banking hall for one service or the other, due to poor service delivery and long stay on the queue will not hesitate to change his bank. Data was collected by direct observation in two banks, one old generation bank and one new generation bank, queue model and other statistical tools were used to analyze the data. Result of the analysis shows that Guaranty Trust Bank is more efficient than First Bank in that the later has a prolonged service time attributed to the preference of it by a pool of customers for many reasons.

Cite This Paper

David O. Ikotun, Justus A. Ademuyiwa, Festus D. Famule,"Comparative Analysis of Customers' Queue Management of First Bank Plc. and Guaranty Trust Bank Plc, Isokun Ilesa, Nigeria", International Journal of Mathematical Sciences and Computing(IJMSC), Vol.2, No.4, pp.1-11, 2016.DOI: 10.5815/ijmsc.2016.04.01

Reference

[1]Journal 19, Gurukul Institute of Engineering and Technology Molina, Application of Theory of Probability to Telephone, 1927.

[2]Framas A.P. Business Mathematics and Statistics 2nd Edition ELBS Publication London, 1990.

[3]Journal 19, Gurukul Institute of Engineering and Technology Molina, Application of Theory of Probability to Telephone, 1927.

[4]Jackson J. R. Networks of Waiting Lines. Operations Research 1957, 5(4); 518-521. 

[5]Little J. A proof for queuing Formula IBM Technical Publication Department, 1961.

[6]Oladapo. International Institution of Science, Technology of Education, 1998.

[7]Ashley. An appraisal of cost of queuing in Nigeria. University of Ilorin Publication, 2002.

[8]Posner M. and Bernholtz B. Closed finite queuing networks with time lag and with several classes of unit, Operations Research, 1965, 16(5), page 977-985.

[9]Lee H. W., Yoon S. H. and Seo W. J. Start-up class models in multiple-class queues with N-policy. Queueing Systems, 1999, 31(1) page 101-124.

[10]Heyman D. P. The policy for the M/G/1 queue, Management Science, 1997, 23(7), 775-778.

[11]Balachandran K. R. and Tijms H. On the D-policy for M/G/1 queue, Management. Science, 1975, 21(9), 1073-1076.

[12]Lee H. W. and Lee S. S. Operating characteristics of MX/G/1 queue with N-policy, Queueing Systems, 1994, 15, 387-399.

[13]Youseef A. Average waiting system of customer in a new queue system with different classes, Business Process Management, 2013, 19(1), 146-168.

[14]Chassiotic E. and Worthingtol DJ. A new model for call center queue management, Operation research society, 2004, 55(12), 1352-1357.

[15]Hussein A.J. Performance study active queue management methods, king saud university, 2015, 27(4), 416-429.