Article ID: | iaor19961462 |
Country: | United Kingdom |
Volume: | 22 |
Issue: | 10 |
Start Page Number: | 995 |
End Page Number: | 1003 |
Publication Date: | Dec 1995 |
Journal: | Computers and Operations Research |
Authors: | Lee Heeseok |
Keywords: | programming: nonlinear |
The main aim of this paper is to present a model for distributing prioritized customers to heterogeneous parallel servers. A queueing optimization model is proposed in the form of a nonlinear programming problem having linear constraints, so that the average mean response time taken over all job requests is minimized. A solution procedure is developed by employing the convexity of the performance objective. A distribution system is illustrated to demonstrate the applicability of the model. In addition, the model is extended to the case of class-dependent policies.