Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism

G.J. Houtum (), I.J.B.F. Adan, J. Wessels and W.H.M. Zijm
Additional contact information
G.J. Houtum: Eindhoven University of Technology
I.J.B.F. Adan: Eindhoven University of Technology
J. Wessels: Eindhoven University of Technology
W.H.M. Zijm: Eindhoven University of Technology

A chapter in Stochastic Modeling of Manufacturing Systems, 2006, pp 289-305 from Springer

Abstract: Abstract In this paper we study a production system consisting of a group of parallel machines producing multiple job types. Each machine has its own queue and it can process a restricted set of job types only. On arrival a job joins the shortest queue among all queues capable of serving that job. Under the assumption of Poisson arrivals and identical exponential processing times we derive upper and lower bounds for the mean waiting time. These bounds are obtained from so-called flexible bound models, and they provide a powerful tool to efficiently determine the mean waiting time. The bounds are used to study how the mean waiting time depends on the amount of overlap (i.e. common job types) between the machines.

Keywords: Queueing system; Shortest queue routing; Performance analysis; Flexibility; Truncation model; Bounds (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-29057-5_12

Ordering information: This item can be ordered from
http://www.springer.com/9783540290575

DOI: 10.1007/3-540-29057-5_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().