메뉴 건너뛰기




Volumn 142, Issue 3, 2002, Pages 577-594

A recursive method for the N policy G/M/1 queueing system with finite capacity

Author keywords

G M 1 queue; Recursive method; Removable server; Steady state probability; Supplementary variable

Indexed keywords

DECISION MAKING; OPTIMAL CONTROL SYSTEMS; PROBABILITY DISTRIBUTIONS; SERVERS;

EID: 0036833118     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00317-4     Document Type: Article
Times cited : (46)

References (20)
  • 1
    • 0000765298 scopus 로고
    • Characterization and computation of optimal policies for operating an M/G/1 queueing system with removable server
    • (1971) Operations Research , vol.19 , pp. 208-218
    • Bell, C.E.1
  • 9
    • 0001654203 scopus 로고
    • A unified approach to GI/M(n)/1/K and M(n)/G/1/K queues via finite quasi-birth-death processes
    • Communications in Statistics
    • (1992) Stochastic Models , vol.8 , Issue.2 , pp. 269-288
    • Kijima, M.1    Makimoto, N.2


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