![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Yutaka Sakuma
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j10]Liron Ravner
, Yutaka Sakuma
:
Strategic arrivals to a queue with service rate uncertainty. Queueing Syst. Theory Appl. 97(3-4): 303-341 (2021) - [j9]Yutaka Sakuma
, Onno J. Boxma, Tuan Phung-Duc
:
An M/PH/1 queue with workload-dependent processing speed and vacations. Queueing Syst. Theory Appl. 98(3-4): 373-405 (2021) - 2020
- [j8]Yutaka Sakuma
, Hiroyuki Masuyama, Emiko Fukuda
:
A discrete-time single-server Poisson queueing game: Equilibria simulated by an agent-based model. Eur. J. Oper. Res. 283(1): 253-264 (2020)
2010 – 2019
- 2019
- [c4]Yutaka Sakuma
, Onno J. Boxma, Tuan Phung-Duc
:
A Single Server Queue with Workload-Dependent Service Speed and Vacations. QTNA 2019: 112-127 - [i1]Liron Ravner, Yutaka Sakuma:
Strategic arrivals to a queue with service rate uncertainty. CoRR abs/1908.08322 (2019) - 2018
- [j7]Kazuki Sakai, Ryusuke Hohzaki, Emiko Fukuda
, Yutaka Sakuma:
Risk evaluation and games in mine warfare considering shipcounter effects. Eur. J. Oper. Res. 268(1): 300-313 (2018) - 2016
- [c3]Hiroyuki Masuyama, Yutaka Sakuma, Masahiro Kobayashi:
Simple error bounds for the QBD approximation of a special class of two dimensional reflecting random walks. QTNA 2016: 23 - 2013
- [j6]Masahiro Kobayashi, Yutaka Sakuma, Masakiyo Miyazawa:
Join the shortest queue among $$k$$ parallel queues: tail asymptotics of its stationary distribution. Queueing Syst. Theory Appl. 74(2-3): 303-332 (2013) - 2012
- [j5]Yutaka Sakuma, Atsushi Inoie:
Stationary distribution of a multi-server vacation queue with constant impatient times. Oper. Res. Lett. 40(4): 239-243 (2012) - [j4]Masahiro Kobayashi, Yutaka Sakuma, Masakiyo Miyazawa:
Tail asymptotics of the stationary distribution for M/M-JSQ with k parallel queues (abstract only). SIGMETRICS Perform. Evaluation Rev. 39(4): 28 (2012) - 2010
- [j3]Yutaka Sakuma:
Asymptotic behavior for MAP/PH/c queue with shortest queue discipline and jockeying. Oper. Res. Lett. 38(1): 7-10 (2010) - [j2]Yutaka Sakuma, Masakiyo Miyazawa:
Asymptotic behavior of the loss rate for Markov-modulated fluid queue with a finite buffer. Queueing Syst. Theory Appl. 65(1): 19-42 (2010) - [c2]Yutaka Sakuma, Atsushi Inoie, Ken'ichi Kawanishi, Masakiyo Miyazawa:
Tail asymptotics for waiting time distribution of an M/M/s queue with general impatient time. QTNA 2010: 140-147
2000 – 2009
- 2009
- [c1]Yutaka Sakuma:
Tail behavior for many server queueing model with join the shortest queue discipline and jockeying. QTNA 2009: 9:1-9:4 - 2006
- [j1]Yutaka Sakuma, Masakiyo Miyazawa, Yiqiang Q. Zhao:
Decay rate for a PH/M/2 queue with shortest queue discipline. Queueing Syst. Theory Appl. 53(4): 189-201 (2006)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint