QUEUING NETWORKS WITH OVERTIME;
APPROXIMATIONS;
DEPARTURE PROCESS;
D O I:
10.1287/mnsc.37.3.282
中图分类号:
C93 [管理学];
学科分类号:
12 ;
1201 ;
1202 ;
120202 ;
摘要:
This paper presents simple approximations for networks of queues with overtime operation at some stations. This type of network is commonly encountered in several manufacturing applications. We provide bounds on the performance of the approximations for single and multiple machine stations. Our results suggest that the methods perform satisfactorily. These approximations can be used in conjunction with parametric decomposition methods to analyze queueing networks. The computational results indicate that the performance of the decomposition approach does not deteriorate when combined with the methods proposed in this paper.
机构:
Vologda State Univ, Vologda, Russia
Russian Acad Sci, Inst Informat Problems, Moscow, Russia
Russian Acad Sci, Inst Socioecon Dev Terr, Vologda, RussiaVologda State Univ, Vologda, Russia
Zeifman, Alexander
Korolev, Victor
论文数: 0引用数: 0
h-index: 0
机构:
Russian Acad Sci, Inst Informat Problems, Moscow, Russia
Moscow MV Lomonosov State Univ, Fac Computat Math & Cybernet, Moscow, RussiaVologda State Univ, Vologda, Russia
Korolev, Victor
Satin, Yacov
论文数: 0引用数: 0
h-index: 0
机构:
Vologda State Univ, Vologda, RussiaVologda State Univ, Vologda, Russia
Satin, Yacov
Korotysheva, Anna
论文数: 0引用数: 0
h-index: 0
机构:
Vologda State Univ, Vologda, RussiaVologda State Univ, Vologda, Russia
Korotysheva, Anna
Bening, Vladimir
论文数: 0引用数: 0
h-index: 0
机构:
Russian Acad Sci, Inst Informat Problems, Moscow, Russia
Moscow MV Lomonosov State Univ, Fac Computat Math & Cybernet, Moscow, RussiaVologda State Univ, Vologda, Russia