具有单个多服务器瓶颈的 D/D/S 系列队列的周期时间

Discrete event dynamic systems Pub Date : 2024-02-03 DOI:10.1007/s10626-023-00392-w

Lonnie Turpin, Morgan Turpin

{"title":"具有单个多服务器瓶颈的 D/D/S 系列队列的周期时间","authors":"Lonnie Turpin, Morgan Turpin","doi":"10.1007/s10626-023-00392-w","DOIUrl":null,"url":null,"abstract":"In this work, we consider D/D/S series queues characterized by deterministic interarrival and service times, with a single multi-server bottleneck stage. When the arrival rate is greater than the bottleneck capacity—for a temporary window of time—the derivation of cycle time is not immediately clear, and warrants a formal proof.","PeriodicalId":92890,"journal":{"name":"Discrete event dynamic systems","volume":"81 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cycle times in D/D/S series queues with single multi-server bottlenecks\",\"authors\":\"Lonnie Turpin, Morgan Turpin\",\"doi\":\"10.1007/s10626-023-00392-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we consider D/D/S series queues characterized by deterministic interarrival and service times, with a single multi-server bottleneck stage. When the arrival rate is greater than the bottleneck capacity—for a temporary window of time—the derivation of cycle time is not immediately clear, and warrants a formal proof.\",\"PeriodicalId\":92890,\"journal\":{\"name\":\"Discrete event dynamic systems\",\"volume\":\"81 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete event dynamic systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s10626-023-00392-w\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete event dynamic systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s10626-023-00392-w","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在这项工作中，我们考虑的是以确定性到达时间和服务时间为特征的 D/D/S 系列队列，其中有一个单一的多服务器瓶颈阶段。当到达率大于瓶颈容量时--一个临时的时间窗口--周期时间的推导并不是一目了然的，需要一个正式的证明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

摘要图片

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Cycle times in D/D/S series queues with single multi-server bottlenecks

In this work, we consider D/D/S series queues characterized by deterministic interarrival and service times, with a single multi-server bottleneck stage. When the arrival rate is greater than the bottleneck capacity—for a temporary window of time—the derivation of cycle time is not immediately clear, and warrants a formal proof.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete event dynamic systems

自引率

0.00%

发文量