Simple and insensitive bounds for a grading and an overflow model
暂无分享,去创建一个
Simple and intuitively obvious lower and upper bounds are suggested for a specific grading and an overflow model. The bounds are based on product-type modifications and are insensitive. Numerical support indicates a potential usefulness for quick engineering purposes.
[1] Jan van der Wal,et al. Simple bounds and monotonicity results for finite multi-server exponential tandem queues , 1989, Queueing Syst. Theory Appl..
[2] Ronald W. Wolff,et al. Poisson Arrivals See Time Averages , 1982, Oper. Res..