Priority Queues with Semi-Exhaustive Service and Class-Dependent Setup Times
スポンサーリンク
概要
- 論文の詳細を見る
This paper considers a new type of priority queues with semi-exhaustive service and setup times, which operates as follows : A single server continues serving class-n messages in queue n until the number of messages decreases to one less than that found upon the server's last arrival at queue n, where 1≤n≤N. In succession, messages of the highest class present in the system, if any, will be served according to this semi-exhaustive service. The following two class-dependent setup-time models are considered : Setup Time I (the first service after a setup time is given to the first arrival during an idle period), and Setup Time II (the first service after a setup time is given to the highest class message in the system at the end of the setup time).
- 富山県立大学の論文
- 1997-03-27
著者
-
Kobayashi Kaori
Department Of Electronics And Inforomatics Faculty Of Engineering
-
KATAYAMA Tsuyoshi
Department of Electronics and Inforomatics, Faculty of Engineering
-
Katayama Tsuyoshi
Department Of Electronics & Informatics Toyama Prefectural University
-
Katayama Tsuyoshi
Department Of Electronics And Inforomatics Faculty Of Engineering
関連論文
- Priority Queues with Semi-Exhaustive Service and Class-Dependent Setup Times
- Sojourn Time Analysis of a Call Processing System with Tandem Queues
- Relaxation of Magnetization in Superfluid ^3He-A
- ANALYSIS OF A TWO-CLASS PRIORITY QUEUE WITH BERNOULLI SCHEDULES
- On Conservation Laws for a Queueing System with Setup Times M^/G^^^→/1[S^^^→]
- Analysis of Waiting Time Distributions in a Priority Queueing System with Bernoulli Schedules
- Detection of Methyl Formate in the Second Torsionally Excited State (v_t=2) in Orion KL
- Long-Term Outcome of Rapidly Progressive Glomerulonephritis: Should We Perform Plasmapheresis or Not?(Renal Disease,General Presentation)