Student Flow Scheduling System for Student Affairs By Using Queuing Theory
DOI:
https://doi.org/10.32628/IJSRSET2073126Keywords:
Student Affairs, Operation Research, Simulation, Queuing analysisAbstract
This Student registration at University involved students being registered in Student Affairs Department and make a deposit in Finance Department within the University, where they would present a form which had previously been filled in by the student. Students often wait for minutes, hours, half day or days to receive registration service for which they were waiting. Delays in the registration may result in difficulties of scheduling at speciality units and decrease in student satisfaction. This system examines the wide-spread problem of extended waiting times for registration. This system implements as student flow scheduling system and can help staff of student affairs department to reduce student congestion in department. This system uses Queuing analysis and Computer Simulation in Operation Research (OR) field. OR is a scientific approach to analyse problem and reduce waiting time. Simulation is the use of a system model that has the mapped characteristics of existence in order to produce the essence of actual operation. This system presents stand-alone application to help student registration using queuing analysis and computer simulation whose are finding appropriate waiting time for student affairs department.
References
- Cheng Yuanjun, Luo Li, A Teller Scheduling Model Based on Queuing Theory and Integer Programming, Chinese Journal of Management, 2010.
- Davis MM, Heineke J. Understanding the role of the customer and the operation for better queue management. Int J of Operations Production Management. 1994;14:21-34.
- Dong Hao, Planning Design and Simulation Research of Automated Warehouse System Based on Queuing Theory, Lanzhou Jiaotong University, 2010
- GAO Ziyou, Wu Jian-jun, Mao Bao-hua, et al. Study on the Complexity of Traffic Netorks and Relate Problems. Journal of Transportation Systems Engineering and Information Technology, 2005, 5(2): 79–84.
- Latora V, Marchiori M. Is the Boston subway a smallword netword? Physica A, 2002 (314): 109–113.
- Parv, M.A Computer Program for Solving General Linear Programming Models University of Agricultural Science and Veterinary Medicine, Calea Manastur nr. 3, 400372 Cluj-Napoa, Romania.
- Strogatz, Steven (2007). "The End of Insight". In Brockman, John. What is your dangerous idea?. HarperCollins. ISSN 9780061214950.
- https://en.wikipedia.org/wiki/Queueing_theory
- https://www.investopedia.com/terms/q/queuing-theory
Downloads
Published
Issue
Section
License
Copyright (c) IJSRSET

This work is licensed under a Creative Commons Attribution 4.0 International License.