Optimizing Order Wait Times in a University Canteen Using Data Structures

Abstract

Efficiently managing queues for main meals in university canteens is a practical yet often overlooked challenge. This paper explores how various data structures and scheduling algorithms influence customer wait times in a simulated canteen environment. We implement and evaluate First-In-First-Out, Random Selection, Shortest Job First, and Priority Queue with Aging strategies. Additionally, we integrate a predictive model using linear regression to dynamically adapt queue strategies based on expected order influx. The results show that the Aging Priority Queue offers the best trade-off between efficiency and fairness, reducing average wait times by 42.66% compared to Random, 17.61% compared to FIFO, and 38.88% compared to SJF (MinHeap). Even though this study focuses on a university canteen, the same approach can be applied to optimizing queues in a wide range of real-world scenarios.

Description

Citation

Dissanayake, D.M.D.R.; Mithushan, W.A.P.R.S.; Weerasinghe, J.; Jeluxshan, T.; Katheesh, W.G.C.W. (2025) Optimizing Order Wait Times in a University Canteen Using Data Structures, Technology Innovations & Digitalization Accompanying Creativity (TIDAC), NSBM Green University, Sri Lanka. P.61-69

Endorsement

Review

Supplemented By

Referenced By