Log in to save to my catalogue

A Tandem Queue with Coupled Processors: Computational Issues

A Tandem Queue with Coupled Processors: Computational Issues

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_207688575

A Tandem Queue with Coupled Processors: Computational Issues

About this item

Full title

A Tandem Queue with Coupled Processors: Computational Issues

Publisher

New York: Springer Nature B.V

Journal title

Queueing systems, 2005-10, Vol.51 (1-2), p.29-52

Language

English

Formats

Publication information

Publisher

New York: Springer Nature B.V

More information

Scope and Contents

Contents

In Resing and Ormeci it is shown that the two-stage tandem queue with coupled processors can be solved using the theory of boundary value problems. In this paper we consider the issues that arise when calculating performance measures like the mean queue length and the fraction of time a station is empty. It is assumed that jobs arrive at the first...

Alternative Titles

Full title

A Tandem Queue with Coupled Processors: Computational Issues

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_proquest_journals_207688575

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_207688575

Other Identifiers

ISSN

0257-0130

E-ISSN

1572-9443

DOI

10.1007/s11134-005-1683-y

How to access this item