Некоторые задачи массового обслуживания с~ограничением
    
    
  
  
  
      
      
      
        
Teoriâ veroâtnostej i ee primeneniâ, Tome 6 (1961) no. 2, pp. 222-228
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			A general queuing scheme is discussed in the paper for the case of a single server and Poisson input. Queuing schemes such as a simple queuing, a system with losses, and a system with restrictions on waiting time or spending time are special cases of the proposed scheme.
			
            
            
            
          
        
      @article{TVP_1961_6_2_a7,
     author = {I. N. Kovalenko},
     title = {{\CYRN}{\cyre}{\cyrk}{\cyro}{\cyrt}{\cyro}{\cyrr}{\cyrery}{\cyre} {\cyrz}{\cyra}{\cyrd}{\cyra}{\cyrch}{\cyri} {\cyrm}{\cyra}{\cyrs}{\cyrs}{\cyro}{\cyrv}{\cyro}{\cyrg}{\cyro} {\cyro}{\cyrb}{\cyrs}{\cyrl}{\cyru}{\cyrzh}{\cyri}{\cyrv}{\cyra}{\cyrn}{\cyri}{\cyrya} {\cyrs}~{\cyro}{\cyrg}{\cyrr}{\cyra}{\cyrn}{\cyri}{\cyrch}{\cyre}{\cyrn}{\cyri}{\cyre}{\cyrm}},
     journal = {Teori\^a vero\^atnostej i ee primeneni\^a},
     pages = {222--228},
     publisher = {mathdoc},
     volume = {6},
     number = {2},
     year = {1961},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TVP_1961_6_2_a7/}
}
                      
                      
                    I. N. Kovalenko. Некоторые задачи массового обслуживания с~ограничением. Teoriâ veroâtnostej i ee primeneniâ, Tome 6 (1961) no. 2, pp. 222-228. http://geodesic.mathdoc.fr/item/TVP_1961_6_2_a7/
