Queuing up for a service is sometimes an inevitable experience. The inefficiencies brought on by extended waiting times can be considerably decreased by precise waiting time prediction. Accurate prediction can substantially improve consumer satisfaction by reducing uncertainty. It is possible to introduce a robust approach to the prediction of waiting times based on previous queuing data and artificial intelligence (AI) algorithms. This paper contributes to the field by offering a robust approach to waiting time prediction and suggests potential directions for further research. The investigation leverages ensemble tree-based methods, supplemented by various data preprocessing techniques for regression analysis to forecast precise waiting times. The following regression models have been used to assess the performance: Random Forest (RF), Extra Trees (ET), Gradient Boosting (GBR), Histogram-Based Gradient Boosting (HGBR), and Voting (VR). Among these, the Extra Trees Regressor demonstrates superior performance. Dimensionality reduction via Principal Component Analysis (PCA) proved less effective than using the original feature sets. Furthermore, the challenge of data imbalance in classification tasks has also been addressed here using the Synthetic Minority Oversampling Technique (SMOTE). This process impressively enhances classification accuracy, especially for minority classes.