Queueing systems with constant service time and evaluation of
                M/D/1,k.

Villy Bæk Iversen

Queueing systems with constant service time and evaluation of M/D/1,k.

Villy Bæk Iversen

Research output: Book/Report › Report › Research › peer-review

Abstract

Systems with constant service times have the particular property that the customers leave the servers in the same order in which they areaccepted for service. Probabilitites of integral waiting times can be expressed by the state probabilities, and non-integral waiting timescan be expressed by integral waiting times. This in combination by a result by Keilson results in an effective algorithm for evaluating M/D/1,k.

Original language	English

Number of pages	11
Publication status	Published - 1997
Event	COST 257 meeting - Helsinki, Finland Duration: 27 May 1997 → 28 May 1997

Conference

Conference	COST 257 meeting
Country/Territory	Finland
City	Helsinki
Period	27/05/1997 → 28/05/1997

OpenUrl availability

Full text

Cite this

@book{08a7eefa8174433a80494d8d72fe5c68,

title = "Queueing systems with constant service time and evaluation of M/D/1,k.",

abstract = "Systems with constant service times have the particular property that the customers leave the servers in the same order in which they areaccepted for service. Probabilitites of integral waiting times can be expressed by the state probabilities, and non-integral waiting timescan be expressed by integral waiting times. This in combination by a result by Keilson results in an effective algorithm for evaluating M/D/1,k.",

author = "Iversen, {Villy B{\ae}k}",

year = "1997",

language = "English",

note = "COST 257 meeting ; Conference date: 27-05-1997 Through 28-05-1997",

}

TY - RPRT

T1 - Queueing systems with constant service time and evaluation of M/D/1,k.

AU - Iversen, Villy Bæk

PY - 1997

Y1 - 1997

N2 - Systems with constant service times have the particular property that the customers leave the servers in the same order in which they areaccepted for service. Probabilitites of integral waiting times can be expressed by the state probabilities, and non-integral waiting timescan be expressed by integral waiting times. This in combination by a result by Keilson results in an effective algorithm for evaluating M/D/1,k.

AB - Systems with constant service times have the particular property that the customers leave the servers in the same order in which they areaccepted for service. Probabilitites of integral waiting times can be expressed by the state probabilities, and non-integral waiting timescan be expressed by integral waiting times. This in combination by a result by Keilson results in an effective algorithm for evaluating M/D/1,k.

M3 - Report

BT - Queueing systems with constant service time and evaluation of M/D/1,k.

T2 - COST 257 meeting

Y2 - 27 May 1997 through 28 May 1997

ER -