Optimal human resource allocation with finite servers and queuing capacity
by C-H. Lan, T-S. Lan, M-S. Chen
International Journal of Computer Applications in Technology (IJCAT), Vol. 24, No. 3, 2005

Abstract: The optimisation of finite queuing capacity in a fast-food store is researched in this study. This paper not only applies queuing theory with finite servers and finite queue size into the mathematical model, but also introduces the cumulative probability function of customer psychological attitude for leaving into the objective function. In addition, the step-by-step algorithm for optimising the human resource allocation is also provided. Moreover, the computerised tool written in the language of Visual Basic to reach the maximum profit is completely proposed in this paper, and a numerical example is discussed to show all steps for achieving the optimal solution. This study definitely contributes an efficient strategy and a practical tool for management decision makers with profound insight.

Online publication date: Mon, 25-Jul-2005

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com