Machine repair problem with variable servers considering balking concept
碩士 === 國立中興大學 === 應用數學系所 === 97 === This thesis studies the machine repair problem with variable servers in which failed machines balk (do not enter) with a constant probability 1-bn. We assume that the minimum number of busy servers is one. The failure times and repair times are both assumed to be...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/20017879997620734545 |