패스트푸드 레스토랑의 효율적 운영방안

Abstract

This study is about comparison of job allocation policies for fast food restaurants. The objectives of the study are to minimize the waiting times of customers in a queueing line and to maximize the revenue of fast food restaurants. Two job allocation polices are considered. To analyze these two job allocation policies under various business conditions, system simulation method is applied. Simulation models are developed using ARENA simulation language. To measure the performance of the policies considered, average waiting times in queue and total number of customers served for simulation time horizon are used. The results show that the combined job policy performs better than the serial job policy under same conditions. If learning effects are allowed for the serial model, in some conditions, the serial one works better than the combined in terms of total served customers. But the combined one still shows superiority to the serial job policy from the waiting time prospective.