한국국방경영분석학회지 (Journal of the military operations research society of Korea)
- 제17권1호
- /
- Pages.43-60
- /
- 1991
- /
- 1229-9898(pISSN)
On The Performance of A Suboptimal Assignment Policy in N-Queue m-Server System
초록
Consider N queues without arrivals and with m identical servers. All jobs are independent and service requirements of jobs in a queue are i.i.d. random variables. At any time only one server may be assigned to a queue and switching between queues are allowed. A unit cost is imposed per job per unit time. The objective is to minimized the expected total cost. An flow approximation model is considered and an upperbound for the percentage error of best nonswitching policies to an optimal policy is found. It is shown that the best nonswitching policy is not worse than
키워드