This paper is concerned mainly with the stochastic modeling and performance evaluation of a generic in®nite servers polling system. We assume that the in®nite number of servers are coupled together and that they visit the queues as one processing unit. That is, we are considering a system where all
✦ LIBER ✦
Polling systems with a patient server and state-dependent setup times
✍ Scribed by YAVUZ GU¨NALAY; DIWAKAR GUPTA
- Book ID
- 110372127
- Publisher
- Taylor and Francis Group
- Year
- 1997
- Tongue
- English
- Weight
- 496 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0740-817X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Analysis of infinite servers polling sys
✍
Thomas (Yew Sing) Lee
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 533 KB
Approximations for the waiting time dist
✍
Tava Lennon Olsen
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 117 KB
Gated Polling Systems with Lévy Inflow a
✍
Iddo Eliazar
📂
Article
📅
2005
🏛
Springer US
🌐
English
⚖ 178 KB
Sojourn and waiting times in a single-se
✍
J. A. Morrison
📂
Article
📅
1989
🏛
Springer US
🌐
English
⚖ 843 KB
Time-dependent analysis of a single-serv
✍
P.R. Parthasarathy; R. Sudhesh
📂
Article
📅
2007
🏛
Elsevier Science
🌐
English
⚖ 248 KB
Scheduling flowshops with finite buffers
✍
Bryan A Norman
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 145 KB
In this paper we explore ¯owshop scheduling problems containing both sequence-dependent setup times and ®nite buers. To the best of our knowledge, problems containing both of these complexities have not been addressed previously in the literature. The problem is clearly NP-hard and therefore we only