메뉴 건너뛰기




Volumn 35, Issue 5, 1997, Pages 1413-1430

An algorithm for sub-optimal routeing in series-parallel queueing networks

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES; PROBABILITY; QUEUEING THEORY;

EID: 0031141616     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075497195399     Document Type: Article
Times cited : (11)

References (10)
  • 1
    • 21144470797 scopus 로고
    • A review of open queueing network models of manufacturing systems
    • Bitran, G. R., and Dasu, S., 1992, A review of open queueing network models of manufacturing systems. Queueing Systems, 12, 95- 134.
    • (1992) Queueing Systems , vol.12
    • Bitran, G.R.1    Dasu, S.2
  • 3
    • 3342946463 scopus 로고
    • PhD thesis, Dept. Of Industrial Engineering and Operations Research, University of Massachusetts, Amherst MA
    • Daskalaki, S., 1988, Static and realtime routeing in open finite queueing networks. PhD thesis, Dept. Of Industrial Engineering and Operations Research, University of Massachusetts, Amherst MA.
    • (1988) Static and Realtime Routeing in Open Finite Queueing Networks
    • Daskalaki, S.1
  • 4
    • 0029543795 scopus 로고
    • Asymptotic bounds on throughput in series-parallel queueing networks
    • Gosavi, H., and MacGregor Smith, J., 1995, Asymptotic bounds on throughput in series-parallel queueing networks, Computers and Operations Research, 22, 1057-1073.
    • (1995) Computers and Operations Research , vol.22 , pp. 1057-1073
    • Gosavi, H.1    Macgregor Smith, J.2
  • 6
    • 0023847309 scopus 로고
    • Asymptotic behaviour of the expansion method for open finite queueing networks
    • Kerbache, L., and MacGregor Smith, J., 1988, Asymptotic behaviour of the expansion method for open finite queueing networks. Comp. Operations Research, 15(2), 157-169.
    • (1988) Comp. Operations Research , vol.15 , Issue.2 , pp. 157-169
    • Kerbache, L.1    Macgregor Smith, J.2
  • 7
    • 0025448957 scopus 로고
    • A survey of closed queueing networks with finite buffers
    • Onvural, R., 1990, A survey of closed queueing networks with finite buffers. ACM Computing Surveys, 22(2), 83-121.
    • (1990) ACM Computing Surveys , vol.22 , Issue.2 , pp. 83-121
    • Onvural, R.1
  • 8
    • 85023455115 scopus 로고
    • Queuing networks with blocking: A bibliography
    • Perros, H. G., 1984, Queuing networks with blocking: a bibliography. ACM Sigmetrics, 12, 812.
    • (1984) ACM Sigmetrics , vol.12 , pp. 812
    • Perros, H.G.1
  • 9
    • 0002144577 scopus 로고
    • Approximation algorithms for open queueing networks with blocking
    • H. Takagi (Ed) (North Holland: Elsevier
    • Perros, H. G., 1990, Approximation algorithms for open queueing networks with blocking. In Stochastic Analysis of Computer and Communication Systems, H. Takagi (Ed) (North Holland: Elsevier).
    • (1990) Stochastic Analysis of Computer and Communication Systems
    • Perros, H.G.1
  • 10
    • 0023983194 scopus 로고
    • Buffer space allocation in automated assembly lines
    • MacGregor Smith, J., and Daskalaki, S., 1988, Buffer space allocation in automated assembly lines. Operations Research, 36(2), 343-358.
    • (1988) Operations Research , vol.36 , Issue.2 , pp. 343-358
    • Macgregor Smith, J.1    Daskalaki, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.