Polling systems with batch service

被引:0
|
作者
J. L. Dorsman
R. D. Van der Mei
E. M. M. Winands
机构
[1] Eindhoven University of Technology,EURANDOM, Department of Mathematics and Computer Science
[2] Centrum Wiskunde & Informatica (CWI),Faculty of Sciences, Department of Mathematics
[3] VU University Amsterdam,undefined
来源
OR Spectrum | 2012年 / 34卷
关键词
Polling systems; Renewal arrivals; Batch arrivals; Optimal batch sizes;
D O I
暂无
中图分类号
学科分类号
摘要
Motivated by applications in production and computer-communication systems, we study an N-queue polling system, consisting of an inner part and an outer part, and where products receive service in batches. Type-i products arrive at the outer system according to a renewal process and accumulate into a type-i batch. As soon as Di products have accumulated, the batch is forwarded to the inner system where the batch is processed. The service requirement of a type-i batch is independent of its size Di. For this model, we study the problem of determining the combination of batch sizes \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\vec{D}^{({\rm opt})} }$$\end{document} that minimizes a weighted sum of the mean waiting times. This model does not allow for an exact analysis. Therefore, we propose a simple closed-form approximation for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\vec{D}^{({\rm opt})}}$$\end{document}, and present a numerical approach, based on the recently proposed mean waiting-time approximation in Boon et al. (Perform Eval 68, 290–306, 2011). Extensive numerical experimentation shows that the numerical approach is slightly more accurate than the closed-form solution, while the latter provides explicit insights into the dependence of the optimal batch sizes on the system parameters and into the behavior of the system. As a by-product, we observe near-insensitivity properties of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\vec{D}^{({\rm opt})}}$$\end{document}, e.g. to higher moments of the interarrival and switch-over time distributions.
引用
收藏
页码:743 / 761
页数:18
相关论文
共 50 条
  • [1] Polling systems with batch service
    Dorsman, J. L.
    Van der Mei, R. D.
    Winands, E. M. M.
    OR SPECTRUM, 2012, 34 (03) : 743 - 761
  • [2] POLLING WITH BATCH SERVICE
    Boxma, Onno
    van der Wal, Jan
    Yechiali, Uri
    STOCHASTIC MODELS, 2008, 24 (04) : 604 - 625
  • [3] Strategic Behavior of Customers and Optimal Control for Batch Service Polling Systems with Priorities
    Jiang, Tao
    Lu, Xingzheng
    Liu, Lu
    Lv, Jun
    Chai, Xudong
    COMPLEXITY, 2020, 2020 (2020)
  • [4] Time-limited polling systems with batch arrivals and phase-type service times
    Al Hanbali, Ahmad
    de Haan, Roland
    Boucherie, Richard J.
    van Ommeren, Jan-Kees
    ANNALS OF OPERATIONS RESEARCH, 2012, 198 (01) : 57 - 82
  • [5] Time-limited polling systems with batch arrivals and phase-type service times
    Ahmad Al Hanbali
    Roland de Haan
    Richard J. Boucherie
    Jan-Kees van Ommeren
    Annals of Operations Research, 2012, 198 : 57 - 82
  • [6] Batch sojourn and delivery times in polling systems on a circle
    Engels, Tim
    Adan, Ivo
    Boxma, Onno
    Resing, Jacques
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2024,
  • [7] Study of polling systems with limited service
    Dianzi Kexue, 1 (44-49):
  • [8] The analysis of batch sojourn-times in polling systems
    Jelmer P. van der Gaast
    Ivo J. B. F. Adan
    René B. M. de Koster
    Queueing Systems, 2017, 85 : 313 - 335
  • [9] The analysis of batch sojourn-times in polling systems
    van der Gaast, Jelmer P.
    Adan, Ivo J. B. F.
    de Koster, Rene B. M.
    QUEUEING SYSTEMS, 2017, 85 (3-4) : 313 - 335
  • [10] ANALYSIS OF A BATCH SERVICE MULTI-SERVER POLLING SYSTEM WITH DYNAMIC SERVICE CONTROL
    Jiang, Tao
    Liu, Liwei
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2018, 14 (02) : 743 - 757