.png){kind=icon}
Return
A simple approximation method for workload analyses in some queueing systems with control policies
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2006.07.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider two systems: M/G/1 with a finite workload capacity and an infinite dam model under P-lambda(M) policy. It is necessary to analyze the workload processes for these systems, which is mostly difficult and complex. An efficient and easy approximation procedure for these systems is provided. Our method is based on the idea that the service time of a customer can be approximated as the sum of small deterministic service times of a batch of customers. This enables us to work with system size processes instead of workload processes. The proposed method turns out to be in excellent agreement with simulation results and exact solution. (c) 2006 Elsevier Ltd. All rights reserved.
Keywords:
M/G/1
P-lambda(M) policy
finite capacity
workload
discretization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
No organization information available
.png){kind=icon}
no more