Optimal Server Assignment in Queues with Flexible Servers and Abandonments

We study a Markovian system of two stations in tandem and two flexible servers who are capable of working at both stations. The novelty of our work is that jobs waiting in line to be processed by the second station may leave the system (without being processed at the second station) after an exponen...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Stochastic systems Ročník 13; číslo 3; s. 360 - 376
Hlavní autori: Andradóttir, Sigrún, Ayhan, Hayriye
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: 01.09.2023
ISSN:1946-5238, 1946-5238
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We study a Markovian system of two stations in tandem and two flexible servers who are capable of working at both stations. The novelty of our work is that jobs waiting in line to be processed by the second station may leave the system (without being processed at the second station) after an exponential amount of time. We show that the dynamic server assignment policy that maximizes the long-run average throughput assigns one server to each station unless station 2 is starved (i.e., has no work) or the number of jobs in the buffer reaches a certain threshold (both servers work together at station 1 when station 2 is starved and at station 2 when the threshold is reached). We specify the criterion for the assignment of the servers to the stations and characterize the threshold. Finally, we investigate how the threshold depends on the service and abandonment rates.
AbstractList We study a Markovian system of two stations in tandem and two flexible servers who are capable of working at both stations. The novelty of our work is that jobs waiting in line to be processed by the second station may leave the system (without being processed at the second station) after an exponential amount of time. We show that the dynamic server assignment policy that maximizes the long-run average throughput assigns one server to each station unless station 2 is starved (i.e., has no work) or the number of jobs in the buffer reaches a certain threshold (both servers work together at station 1 when station 2 is starved and at station 2 when the threshold is reached). We specify the criterion for the assignment of the servers to the stations and characterize the threshold. Finally, we investigate how the threshold depends on the service and abandonment rates.
Author Andradóttir, Sigrún
Ayhan, Hayriye
Author_xml – sequence: 1
  givenname: Sigrún
  surname: Andradóttir
  fullname: Andradóttir, Sigrún
  organization: H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
– sequence: 2
  givenname: Hayriye
  orcidid: 0000-0002-3481-1093
  surname: Ayhan
  fullname: Ayhan, Hayriye
  organization: H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
BookMark eNpNkMtOwzAURC1UJErplrV_IMGP2ImXUUV5qFKFgLVlO9cQlDqVnQL9exLogruYO4vRSHMu0Sz0ARC6piSnrCpv0pCOOSOM54QSdYbmVBUyE4xXs3_-Ai1T-iDjSSKEqubocbsf2p3p8DPET4i4Tql9CzsIA24DfjrAARL-aod3vO7gu7UdnJIJm9Dg2o7a_-bTFTr3pkuwPP0Fel3fvqzus8327mFVbzJHC6VGpaoE5SvpeCMZccICt8JbTqwTphHGWeqYNEaUhrhGebCFkKQR3nhSSL5A-V-vi31KEbzex3FCPGpK9ARDTzD0BENPMPgPcalWPg
Cites_doi 10.1007/s11134-010-9201-2
10.1017/S0269964802164047
10.1287/opre.1110.0990
10.1007/s11134-013-9342-1
10.1007/s11134-013-9373-7
10.2139/ssrn.3453227
10.1007/s11134-008-9078-5
10.1287/11-SSY029
10.1007/s11134-012-9281-2
10.1287/opre.1050.0227
10.1007/s11134-012-9290-1
10.1287/opre.11.1.88
10.1002/9780470316887
10.1007/s11134-022-09792-5
10.1007/s11134-017-9554-x
10.1017/S0269964807000010
10.1287/opre.5.5.650
10.1016/j.peva.2013.02.001
10.1111/poms.12825
10.1287/mnsc.47.10.1421.10262
10.1287/opre.2019.1908
10.1007/s11134-013-9366-6
10.1007/s11134-016-9489-7
10.2307/1427345
10.1023/A:1019181124314
10.1287/mnsc.2014.2058
10.1080/24725579.2019.1620384
10.1016/j.peva.2019.102011
10.1287/opre.1100.0826
10.1007/s11134-010-9205-y
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1287/stsy.2023.0109
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1946-5238
EndPage 376
ExternalDocumentID 10_1287_stsy_2023_0109
GroupedDBID 5VS
AAYXX
AFFOW
AHQJS
AKVCP
ALMA_UNASSIGNED_HOLDINGS
AMVHM
CITATION
EBA
EBE
EBO
EBR
EBU
FRP
GR0
GROUPED_DOAJ
H13
J9A
KQ8
M~E
OK1
RBV
RPE
RPU
ID FETCH-LOGICAL-c1499-c1197e9f86c3d620c5be3b5fb30bc5ad5acb1c26aa57a0cd9feb4560d5faf0463
ISSN 1946-5238
IngestDate Sat Nov 29 03:48:31 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c1499-c1197e9f86c3d620c5be3b5fb30bc5ad5acb1c26aa57a0cd9feb4560d5faf0463
ORCID 0000-0002-3481-1093
OpenAccessLink https://doi.org/10.1287/stsy.2023.0109
PageCount 17
ParticipantIDs crossref_primary_10_1287_stsy_2023_0109
PublicationCentury 2000
PublicationDate 2023-09-00
PublicationDateYYYYMMDD 2023-09-01
PublicationDate_xml – month: 09
  year: 2023
  text: 2023-09-00
PublicationDecade 2020
PublicationTitle Stochastic systems
PublicationYear 2023
References B23
Das S (B16) 2013; 75
B24
Zayas-Cabán G (B34) 2019; 9
Brandt A (B13) 2013; 75
Boxma O (B12) 2011; 67
Ancker CJ (B3) 1963; 11
Puterman ML (B27) 1994
Wang J (B30) 2019; 135
Moyal P (B25) 2013; 75
Batt RJ (B11) 2015; 61
van Leeuwen D (B29) 2017; 87
Down DG (B17) 2011; 67
B31
Ayhan H (B8) 2022; 100
B10
Iravani S (B19) 1997; 26
Zayas-Cabán G (B33) 2016; 84
Andradóttir S (B4) 2001; 47
Yu Z (B32) 2023
Jouini O (B21) 2007; 21
Baccelli F (B9) 1984; 16
Dai JG (B14) 2013; 3
Ahn HS (B2) 2002; 16
B6
Kim C (B22) 2013; 70
Dai JG (B15) 2008; 59
Armony M (B5) 2017; 27
Reed J (B28) 2013; 73
Fralix BH (B18) 2013; 75
Atar R (B7) 2010; 58
References_xml – volume: 67
  start-page: 63
  year: 2011
  ident: B17
  publication-title: Queueing Systems
  doi: 10.1007/s11134-010-9201-2
– volume: 16
  start-page: 453
  year: 2002
  ident: B2
  publication-title: Probab. Engrg. Inform. Sci.
  doi: 10.1017/S0269964802164047
– ident: B23
  doi: 10.1287/opre.1110.0990
– volume: 75
  start-page: 211
  year: 2013
  ident: B25
  publication-title: Queueing Systems
  doi: 10.1007/s11134-013-9342-1
– volume: 75
  start-page: 189
  year: 2013
  ident: B13
  publication-title: Queueing Systems
  doi: 10.1007/s11134-013-9373-7
– ident: B6
  doi: 10.2139/ssrn.3453227
– volume: 59
  start-page: 95
  year: 2008
  ident: B15
  publication-title: Queueing Systems
  doi: 10.1007/s11134-008-9078-5
– volume: 3
  start-page: 96
  year: 2013
  ident: B14
  publication-title: Stochastic Systems
  doi: 10.1287/11-SSY029
– volume: 75
  start-page: 149
  year: 2013
  ident: B18
  publication-title: Queueing Systems
  doi: 10.1007/s11134-012-9281-2
– ident: B31
  doi: 10.1287/opre.1050.0227
– volume: 73
  start-page: 1
  year: 2013
  ident: B28
  publication-title: Queueing Systems
  doi: 10.1007/s11134-012-9290-1
– volume: 11
  start-page: 88
  year: 1963
  ident: B3
  publication-title: Oper. Res.
  doi: 10.1287/opre.11.1.88
– volume-title: Markov Decision Processes
  year: 1994
  ident: B27
  doi: 10.1002/9780470316887
– volume: 100
  start-page: 393
  year: 2022
  ident: B8
  publication-title: Queueing Systems
  doi: 10.1007/s11134-022-09792-5
– volume: 87
  start-page: 269
  year: 2017
  ident: B29
  publication-title: Queueing Systems
  doi: 10.1007/s11134-017-9554-x
– volume: 21
  start-page: 335
  year: 2007
  ident: B21
  publication-title: Probab. Engrg. Inform. Sci.
  doi: 10.1017/S0269964807000010
– ident: B10
  doi: 10.1287/opre.5.5.650
– volume: 70
  start-page: 440
  year: 2013
  ident: B22
  publication-title: Performance Evaluation
  doi: 10.1016/j.peva.2013.02.001
– volume: 27
  start-page: 859
  year: 2017
  ident: B5
  publication-title: Production Oper. Management
  doi: 10.1111/poms.12825
– volume: 47
  start-page: 1421
  year: 2001
  ident: B4
  publication-title: Management Sci.
  doi: 10.1287/mnsc.47.10.1421.10262
– ident: B24
  doi: 10.1287/opre.2019.1908
– volume: 75
  start-page: 169
  year: 2013
  ident: B16
  publication-title: Queueing Systems
  doi: 10.1007/s11134-013-9366-6
– volume: 84
  start-page: 279
  year: 2016
  ident: B33
  publication-title: Queueing Systems
  doi: 10.1007/s11134-016-9489-7
– volume: 16
  start-page: 887
  year: 1984
  ident: B9
  publication-title: Adv. Appl. Probab.
  doi: 10.2307/1427345
– volume: 26
  start-page: 203
  year: 1997
  ident: B19
  publication-title: Queueing Systems
  doi: 10.1023/A:1019181124314
– volume: 61
  start-page: 39
  year: 2015
  ident: B11
  publication-title: Management Sci.
  doi: 10.1287/mnsc.2014.2058
– volume: 9
  start-page: 342
  year: 2019
  ident: B34
  publication-title: IISE Trans. Healthcare Systems Engrg.
  doi: 10.1080/24725579.2019.1620384
– volume: 135
  start-page: 102011
  year: 2019
  ident: B30
  publication-title: Performance Evaluation
  doi: 10.1016/j.peva.2019.102011
– year: 2023
  ident: B32
  publication-title: Probab. Engrg. Inform. Sci.
– volume: 58
  start-page: 1427
  year: 2010
  ident: B7
  publication-title: Oper. Res.
  doi: 10.1287/opre.1100.0826
– volume: 67
  start-page: 207
  year: 2011
  ident: B12
  publication-title: Queueing Systems
  doi: 10.1007/s11134-010-9205-y
SSID ssj0000605598
Score 2.237337
Snippet We study a Markovian system of two stations in tandem and two flexible servers who are capable of working at both stations. The novelty of our work is that...
SourceID crossref
SourceType Index Database
StartPage 360
Title Optimal Server Assignment in Queues with Flexible Servers and Abandonments
Volume 13
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1946-5238
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000605598
  issn: 1946-5238
  databaseCode: M~E
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1BT9swFLYY7LAdpsE2sQ2QD5s4TOnSOK7jY0FDFWIMtG7qLbIdm-bQgNow0Qu_nffiJA2DAzvsYlWWbaX-Pr3n9_z8HiGfktiGsXBZoLXBEmahDTRYHYEEaaljYZKsesf9-0ScniaTiTyrY1UXVTkBURTJzY28-q9QQx-AjU9n_wHudlHogN8AOrQAO7RPAv4HCIEZ5vjAWMY57n9-4a_88-LL-bUFPeC9r0eYCxMfTvmRPlnzUCus7zFrUjw1B9ef5aWZKkzqXCd_bs_iGBIJPDlknw9YWea-jld-UV3BHwxb7g2XU-9rHanlPF_arrshYm08VSMhJSAJ1qsXmvaRvkassg59WEdGMl9AoFa3zJd_eSDJo6R62Vwulj38jB5e4a10VnNP_5cqawMM0bSBFVKcn-L8FOc_IxuR4BIj_77frlxxIZh0vKqa3P6ROr0nLPH1_id0ji-dc8j4NXlVGxB06IHfJGu22CIvO2kl35DjmgLUA0tXFKB5QT0FKFKANhSoRy4ogE-7FHhLfh19Gx-OgrpmRmDA1pXQ9qWw0iUDw7JBFBquLdPcaRZqw1XGldF9Ew2U4kKFJpPOajhDhxl3ymH2uHdkvbgs7DahQnGFrua-cTxWjEsjjRGgPF0mDXfiPdlvtiK98qlR0sf3_cOTR34kL1ak2yHr5fza7pLn5k-ZL-Z7FWx3eepcPw
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimal+Server+Assignment+in+Queues+with+Flexible+Servers+and+Abandonments&rft.jtitle=Stochastic+systems&rft.au=Andrad%C3%B3ttir%2C+Sigr%C3%BAn&rft.au=Ayhan%2C+Hayriye&rft.date=2023-09-01&rft.issn=1946-5238&rft.eissn=1946-5238&rft.volume=13&rft.issue=3&rft.spage=360&rft.epage=376&rft_id=info:doi/10.1287%2Fstsy.2023.0109&rft.externalDBID=n%2Fa&rft.externalDocID=10_1287_stsy_2023_0109
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1946-5238&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1946-5238&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1946-5238&client=summon