ABSTRACT
Waiting time in queues is the main problem faced by peoples in these dates such as businesses, colleges, offices, hospitals, canteens, book stores, libraries, banks, post offices, gas pumps, cinemas, dance halls etc. The aim of the present research is to find the identify and solve the waiting line problems in college canteens. Waiting time in queues are common phenomena, which we face on a daily basis. The fundamental features of a waiting line phenomenon are that entities arrive at a specific point called the service centre at regular or sporadic intervals of time. The “QUEUING OR WAITING LINES” may be either related to a scheduled arrival or the delivery of an appropriate quantity of services or both, in order to attain an optimal stability among the cost related to idle time & waiting time. In the college cafeteria or canteen students expect a definite level of facility; however, the owner of canteen delivering service facilities attempts to spend as little as possible to maximize their profits while delivering the essential service. This study exhibits the optimization between the waiting time and the service provided. The present study has conducted to optimize the demand as well as the service rendered to maximize the utilization factor. For the purposes of the current study, a canteen in an educational institute has been identified and data, in the form of arrival rate and departure rate, has been observed. The data collected during the peak or rush hours i.e., from 10:00 a.m. to 12:00 p.m. and from 11:45 a.m. to 1:45 p.m. and these hours were then split into six divisions, with each division being of 20 minutes duration. From that data various parameters, i.e., the average (mean) time a student devotes in the canteen, the average waiting time of a student in the waiting line, and the utilization rate etc. were also observed. After the implementation of the queuing technique it was found that there is a saving of Rs.168 per day if the person running the canteen employs two service providers instead of three.
