Theoretical and Natural Science

- The Open Access Proceedings Series for Conferences


Theoretical and Natural Science

Vol. 19, 08 December 2023


Open Access | Article

Optimizing the counter service based on linear programming and queue theory

Qingyuan Guo * 1
1 University of Pittsburgh

* Author to whom correspondence should be addressed.

Theoretical and Natural Science, Vol. 19, 116-125
Published 08 December 2023. © 2023 The Author(s). Published by EWA Publishing
This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Citation Qingyuan Guo. Optimizing the counter service based on linear programming and queue theory. TNS (2023) Vol. 19: 116-125. DOI: 10.54254/2753-8818/19/20230513.

Abstract

With the progress of the social economy, the pace of people's life and work is accelerating, and queuing has gradually become a key factor affecting the service level and quality of enterprises. Although the queuing problem has been gradually optimized, there are still some problems such as queue congestion and confusion, inadequate work of staff, and low efficiency. It can be seen that effective measures have been taken to properly solve the queuing problem in China's service industry and other industries. This paper is aimed at using the method that combined linear programming with queue theory to develop 3 steps to optimize the manpower scheduling problem for a real-world situation. A case study of the local government service counter is provided. After applying our model to the case problem, we have achieved three goals: to reduce the number of staff to a more accurate state. Our research finds that there exist some real problems with the service like their service rate is a bit low and needs to improve. In addition, this model has application value for a wide range of other fields, such as banks, post offices and other scenarios.

Keywords

Linear programming, Queue theory, Service.

References

1. Lee, Y., Chen, A. N. K., & Hess, T. . (2017). The online waiting experience: using temporal information and distractors to make online waits feel shorter. Journal of the Association for Information Systems, 18(3), 231-263.

2. Poomrittigul, S., Koomsubsiri, A., Aung, H. L., Sasithong, P., & Wuttisittikulkij, L. . (2020). Ticket Machine Queuing System Design Application for Service Efficiency Simulation and Comparison. 2020 International Conference on Electronics, Information, and Communication (ICEIC).

3. Zhang, Z., & Li, J. . (2017). The practice and consideration of deepening administration system reform. Journal of Tianjin University (Social Sciences).

4. Antonova, P. , & Titovtsev, A. . (2020). On Real Queue Length in a Queueing System with Erlang-r service time. 2020 4th Scientific School on Dynamics of Complex Networks and their Application in Intellectual Robotics (DCNAIR).

5. Mudasir, S., & Ahmad, S. P. . (2017). Characterization and information measures of weighted erlang distribution. Journal of Statistics Applications & Probability Letters, 4(3), 109-122.

6. Han, X., & Wang, D. . (2021). Research on the application of system theory in traffic engineering. Journal of Physics: Conference Series, 1972(1), 012112-.

7. Manpower Scheduling, Turnaround Project Planning Primer, https://www.interplansystems.com/turnaround-project-management-primer/manpower-scheduling.html

8. J. G Morris, and M. J. Showalter (1983), "Simple Approaches to Shift, Days-Off and Tour Scheduling Problems." Management Science, vol. 29, no. 8, pp. 942-950, Aug. 1983.

9. Khoong, C. M. (1999). Some Optimization Models for Manpower Planning. Information Knowledge Systems Management. 1999, Vol. 1 Issue 2, p159. 9p. 1 Black and White Photograph, 2 Diagrams, 1 Chart.

10. Patola, I. E., Suhardi, & Kurniawan, N. B. . (2016). Modeling IT public value for IT performance measurement in government organization: A case study: BPS-statistics Indonesia. 2016 International Conference on Information Technology Systems and Innovation (ICITSI). IEEE.

11. Ritzman, L. P. , & Krajewski, L. J. . (2010). Multiple objectives in linear programming –an example in scheduling postal resources. Decision Sciences, 4(3), 364-378.

Data Availability

The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. Authors who publish this series agree to the following terms:

1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this series.

2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this series.

3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See Open Access Instruction).

Volume Title
Proceedings of the 2nd International Conference on Computing Innovation and Applied Physics
ISBN (Print)
978-1-83558-203-9
ISBN (Online)
978-1-83558-204-6
Published Date
08 December 2023
Series
Theoretical and Natural Science
ISSN (Print)
2753-8818
ISSN (Online)
2753-8826
DOI
10.54254/2753-8818/19/20230513
Copyright
08 December 2023
Open Access
This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited

Copyright © 2023 EWA Publishing. Unless Otherwise Stated