Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue

The prime objective of this paper is to give some analysis results concerning the discrete-time finite-buffer NT -policy queue, which can be utilized to determine the optimal threshold values. By recording the waiting time of the leading customer in server’s vacation period, the model is successfull...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Operational research Ročník 16; číslo 2; s. 161 - 179
Hlavní autori: Yu, Miaomiao, Alfa, Attahiru Sule
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2016
Springer Nature B.V
Predmet:
Branching (mathematics)
Business and Management
Computational Intelligence
Computer engineering
Cost analysis
Customer services
Decomposition
Management Science
Markov analysis
Mathematical models
Operating costs
Operations Research
Operations Research/Decision Theory
Optimization
Original Paper
Policies
Queues
Queuing
Regeneration
Search methods
Servers
Studies
Vacations
90B22
RG-factorization
Stochastic decomposition
68M20
60K25
policy queue
busy period
Cost optimization
ISSN:1109-2858, 1866-1505
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract The prime objective of this paper is to give some analysis results concerning the discrete-time finite-buffer NT -policy queue, which can be utilized to determine the optimal threshold values. By recording the waiting time of the leading customer in server’s vacation period, the model is successfully described as a vector-valued Markov chain. Meanwhile, depending on the special block structure of the one-step transition probability matrix, the equilibrium queue length distribution is calculated through a more effective UL-type RG-factorization. Due to the number of customers served in the busy period does not have the structure of a Galton-Watson branching process, analysis of the regeneration cycle is regarded as a difficult problem in establishing the cost structure of the queueing system. However, employing the concept of i -busy period and some difference equation solving skills, the explicit expression for the expected length of the regeneration cycle is easily derived, and the stochastic decomposition structure of the busy period is also demonstrated. Finally, numerical results are offered to illustrate how the direct search method can be implemented to obtain the optimal management policy.
AbstractList The prime objective of this paper is to give some analysis results concerning the discrete-time finite-buffer NT-policy queue, which can be utilized to determine the optimal threshold values. By recording the waiting time of the leading customer in server's vacation period, the model is successfully described as a vector-valued Markov chain. Meanwhile, depending on the special block structure of the one-step transition probability matrix, the equilibrium queue length distribution is calculated through a more effective UL-type RG-factorization. Due to the number of customers served in the busy period does not have the structure of a Galton-Watson branching process, analysis of the regeneration cycle is regarded as a difficult problem in establishing the cost structure of the queueing system. However, employing the concept of i-busy period and some difference equation solving skills, the explicit expression for the expected length of the regeneration cycle is easily derived, and the stochastic decomposition structure of the busy period is also demonstrated. Finally, numerical results are offered to illustrate how the direct search method can be implemented to obtain the optimal management policy.
The prime objective of this paper is to give some analysis results concerning the discrete-time finite-buffer NT -policy queue, which can be utilized to determine the optimal threshold values. By recording the waiting time of the leading customer in server’s vacation period, the model is successfully described as a vector-valued Markov chain. Meanwhile, depending on the special block structure of the one-step transition probability matrix, the equilibrium queue length distribution is calculated through a more effective UL-type RG-factorization. Due to the number of customers served in the busy period does not have the structure of a Galton-Watson branching process, analysis of the regeneration cycle is regarded as a difficult problem in establishing the cost structure of the queueing system. However, employing the concept of i -busy period and some difference equation solving skills, the explicit expression for the expected length of the regeneration cycle is easily derived, and the stochastic decomposition structure of the busy period is also demonstrated. Finally, numerical results are offered to illustrate how the direct search method can be implemented to obtain the optimal management policy.
Author Alfa, Attahiru Sule
Yu, Miaomiao
Author_xml – sequence: 1
  givenname: Miaomiao
  surname: Yu
  fullname: Yu, Miaomiao
  email: mmyu75@163.com
  organization: School of Science, Sichuan University of Science and Engineering, Department of Electrical and Computer Engineering, University of Manitoba
– sequence: 2
  givenname: Attahiru Sule
  surname: Alfa
  fullname: Alfa, Attahiru Sule
  organization: Department of Electrical and Computer Engineering, University of Manitoba, Department of Electrical, Electronic and Computer Engineering, University of Pretoria
BookMark eNp9kU9rXSEQxaWk0DTJB8hO6KYbG0efV9-yhP6DkC6SrsWnY2O493qrXsrrp68vr4sSaAV1Fr8zc5jzmpzMeUZCLoG_A871VQUhFTAOqt8tZ_wFOQUzDAwUVye9Br5lwijzilzU-sj7kUKbjTkly12ekLrZjfuaKi1Y17FV6mrNPrmGgf5M7YG2B6R5aWlKv1xLeaZLybsRJxpzoY6GVH3BhqwTSGOaU693a4xY6O09W_KY_J7-WHHFc_IyurHixZ__jHz7-OH--jO7-frpy_X7G-allo2h5oMMxjvRH0C1hRC5CM44qYKOPGCIG_RbF8ErhbADrYXegVGR6zBs5Bl5e-zbnfbBtdmpm8RxdDPmtVowUqlBan1A3zxDH_Na-koOFPSFDkLITsGR8iXXWjDapaTJlb0Fbg8x2GMMtsdgDzFY3jX6mcan9rTAVlwa_6sUR2XtU-bvWP7y9E_RbzHVnzA
CitedBy_id crossref_primary_10_1155_2021_6364352
Cites_doi 10.1057/palgrave.jors.2601536
10.1002/(SICI)1520-6750(200004)47:3<240::AID-NAV4>3.0.CO;2-E
10.1016/S0166-5316(00)00015-8
10.1007/BF01149327
10.1080/07362999508809382
10.1287/mnsc.19.9.1013
10.1287/mnsc.23.7.775
10.1016/j.mcm.2004.08.009
10.1057/jors.1963.63
10.1016/0305-0548(94)00088-P
10.1016/j.cie.2006.04.004
10.1016/S0307-904X(03)00074-X
10.1017/S0269964800004174
10.1016/j.ejor.2011.05.043
10.1007/978-3-642-11492-2
10.1007/978-3-642-13568-2_3
10.1002/dac.1288
10.1016/j.apm.2005.03.022
10.1017/S026996480800020X
10.1016/0377-2217(94)00206-1
10.3934/jimo.2014.10.131
ContentType Journal Article
Copyright Springer-Verlag Berlin Heidelberg 2015
Springer-Verlag Berlin Heidelberg 2016
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2015
– notice: Springer-Verlag Berlin Heidelberg 2016
DBID AAYXX
CITATION
3V.
7TB
7WY
7WZ
7XB
87Z
8FD
8FE
8FG
8FK
8FL
ABJCF
ABUWG
AFKRA
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FR3
FRNLG
F~G
HCIFZ
K60
K6~
K8~
KR7
L.-
L.0
L6V
M0C
M7S
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
7TA
JG9
DOI 10.1007/s12351-015-0190-0
DatabaseName CrossRef
ProQuest Central (Corporate)
Mechanical & Transportation Engineering Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
SciTech Premium Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central
Business Premium Collection
Technology Collection
ProQuest One Community College
ProQuest Central
Engineering Research Database
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
SciTech Premium Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
DELNET Management Collection
Civil Engineering Abstracts
ABI/INFORM Professional Advanced
ABI/INFORM Professional Standard
ProQuest Engineering Collection
ProQuest ABI/INFORM Global
Engineering Database
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Business (OCUL)
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering collection
ProQuest Central Basic
Materials Business File
Materials Research Database
DatabaseTitle CrossRef
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ABI/INFORM Complete
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ABI/INFORM Professional Standard
ProQuest Central Korea
ProQuest Central (New)
ABI/INFORM Complete (Alumni Edition)
Engineering Collection
Business Premium Collection
Civil Engineering Abstracts
ABI/INFORM Global
Engineering Database
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
ProQuest DELNET Management Collection
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
Engineering Research Database
ProQuest One Academic
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
ProQuest One Academic (New)
Materials Research Database
Materials Business File
DatabaseTitleList ABI/INFORM Global (Corporate)
Materials Research Database
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1866-1505
EndPage 179
ExternalDocumentID 4149465851
10_1007_s12351_015_0190_0
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 71301111, 71171138, 71402072
  funderid: http://dx.doi.org/10.13039/501100001809
GroupedDBID -57
-5G
-BR
-EM
-Y2
-~C
.VR
06D
0R~
0VY
123
1N0
203
29N
2J2
2JN
2JY
2KG
2KM
2LR
2VQ
30V
3V.
4.4
406
408
40D
40E
5VS
67Z
6NX
7WY
875
8FE
8FG
8FL
8TC
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABDZT
ABECU
ABFTV
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABMNI
ABMQK
ABNWP
ABQBU
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACPIV
ACSNA
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
AXYYD
AYQZM
B-.
BA0
BAPOH
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DNIVK
DPUIP
DWQXO
EBLON
EBS
EIOEI
EJD
ESBYG
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GROUPED_ABI_INFORM_COMPLETE
H13
HCIFZ
HF~
HG6
HLICF
HMJXF
HRMNR
HZ~
IKXTQ
IWAJR
IXD
I~X
I~Z
J-C
J0Z
JBSCW
JZLTJ
K60
K6~
K8~
KOV
L6V
LLZTM
M0C
M4Y
M7S
MA-
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9J
P9M
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PTHSS
Q2X
QOS
R89
R9I
ROL
RPX
RSV
S16
S1Z
S27
S3B
SAP
SBE
SDH
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TSG
TSK
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W48
WK8
YLTOR
Z45
Z5O
Z81
ZMTXR
~A9
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
7TB
7XB
8FD
8FK
FR3
KR7
L.-
L.0
PKEHL
PQEST
PQUKI
PRINS
Q9U
7TA
JG9
PUEGO
ID FETCH-LOGICAL-c373t-e7063d8ca2d8c1e591df02da8a35d7f0dedf4ec9af1c55e1b17727b185f07d643
IEDL.DBID RSV
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000380151400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1109-2858
IngestDate Thu Oct 02 12:16:33 EDT 2025
Tue Nov 04 21:58:13 EST 2025
Sat Nov 29 05:50:48 EST 2025
Tue Nov 18 20:49:49 EST 2025
Fri Feb 21 02:34:54 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords 90B22
RG-factorization
Stochastic decomposition
68M20
60K25
policy queue
busy period
Cost optimization
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c373t-e7063d8ca2d8c1e591df02da8a35d7f0dedf4ec9af1c55e1b17727b185f07d643
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
PQID 1811906223
PQPubID 326268
PageCount 19
ParticipantIDs proquest_miscellaneous_1835563774
proquest_journals_1811906223
crossref_primary_10_1007_s12351_015_0190_0
crossref_citationtrail_10_1007_s12351_015_0190_0
springer_journals_10_1007_s12351_015_0190_0
PublicationCentury 2000
PublicationDate 2016-07-01
PublicationDateYYYYMMDD 2016-07-01
PublicationDate_xml – month: 07
  year: 2016
  text: 2016-07-01
  day: 01
PublicationDecade 2010
PublicationPlace Berlin/Heidelberg
PublicationPlace_xml – name: Berlin/Heidelberg
– name: Heidelberg
PublicationSubtitle An International Journal
PublicationTitle Operational research
PublicationTitleAbbrev Oper Res Int J
PublicationYear 2016
Publisher Springer Berlin Heidelberg
Springer Nature B.V
Publisher_xml – name: Springer Berlin Heidelberg
– name: Springer Nature B.V
References Tadj (CR21) 2003; 54
Wu, Tang, Yu (CR22) 2014; 1
Alfa, Li (CR2) 2000; 42
Doshi (CR5) 1986; 1
Gupta (CR10) 1995; 22
Ke (CR15) 2006; 30
Li (CR17) 2010
Doganata, Arikan (CR4) 1990
Heyman (CR11) 1977; 23
Pacheco, Ribeiro (CR19) 2008; 22
Ross (CR20) 1996
Balachandran (CR3) 1973; 19
Ke (CR16) 2006; 50
Zhang, Tadj, Bounkhel (CR24) 2011; 214
Hur, Kim, Kang (CR12) 2003; 27
Feyaerts, Vuyst, Bruneel, Wittevrongel (CR7) 2014; 10
Ke (CR14) 2005; 41
Jiang, Huang, Yang, Lin, Wang (CR13) 2010; 25
Yadin, Naor (CR23) 1963; 14
Alfa, Frigui (CR1) 1996; 88
Feyaerts, Vuyst, Wittevrongel, Bruneel (CR6) 2010; 6148
Gakis, Rhee, Sivazlian (CR9) 1995; 13
Li, Alfa (CR18) 2000; 47
Feinberg, Kim (CR8) 1996; 10
YN Doganata (190_CR4) 1990
B Feyaerts (190_CR7) 2014; 10
JC Ke (190_CR16) 2006; 50
M Yadin (190_CR23) 1963; 14
L Tadj (190_CR21) 2003; 54
AS Alfa (190_CR1) 1996; 88
WQ Wu (190_CR22) 2014; 1
S Hur (190_CR12) 2003; 27
DP Heyman (190_CR11) 1977; 23
BT Doshi (190_CR5) 1986; 1
W Li (190_CR18) 2000; 47
SM Ross (190_CR20) 1996
KG Gakis (190_CR9) 1995; 13
FC Jiang (190_CR13) 2010; 25
B Feyaerts (190_CR6) 2010; 6148
A Pacheco (190_CR19) 2008; 22
JC Ke (190_CR15) 2006; 30
AS Alfa (190_CR2) 2000; 42
QL Li (190_CR17) 2010
JC Ke (190_CR14) 2005; 41
ZG Zhang (190_CR24) 2011; 214
EA Feinberg (190_CR8) 1996; 10
SM Gupta (190_CR10) 1995; 22
KR Balachandran (190_CR3) 1973; 19
References_xml – volume: 54
  start-page: 466
  year: 2003
  end-page: 471
  ident: CR21
  article-title: On an M/G/1 quorum queueing system under T-policy
  publication-title: J Oper Res Soc
  doi: 10.1057/palgrave.jors.2601536
– volume: 1
  start-page: 1
  year: 2014
  end-page: 19
  ident: CR22
  article-title: Analysis of an M/G/1 queue with multiple vacations, N-policy, unreliable service station and repair facility failures
  publication-title: Int J Supply Oper Manag
– volume: 47
  start-page: 240
  year: 2000
  end-page: 258
  ident: CR18
  article-title: Optimal policies for M/M/m queue with two different kinds of (N, T)-policies
  publication-title: Naval Res Logist
  doi: 10.1002/(SICI)1520-6750(200004)47:3<240::AID-NAV4>3.0.CO;2-E
– volume: 42
  start-page: 265
  year: 2000
  end-page: 277
  ident: CR2
  article-title: Optimal (N, T)-policy for M/G/1 system with cost structures
  publication-title: Perform Eval
  doi: 10.1016/S0166-5316(00)00015-8
– volume: 1
  start-page: 29
  year: 1986
  end-page: 66
  ident: CR5
  article-title: Queueing systems with vacations-A survey
  publication-title: Queueing Syst
  doi: 10.1007/BF01149327
– volume: 13
  start-page: 47
  year: 1995
  end-page: 81
  ident: CR9
  article-title: Distributions and first moments of the busy and idle periods in controllable M/G/1 queueing models with simple and dyadic policies
  publication-title: Stoch Anal Appl
  doi: 10.1080/07362999508809382
– volume: 19
  start-page: 1013
  year: 1973
  end-page: 1018
  ident: CR3
  article-title: Control policies for a single server system
  publication-title: Manag Sci
  doi: 10.1287/mnsc.19.9.1013
– volume: 23
  start-page: 775
  year: 1977
  end-page: 778
  ident: CR11
  article-title: T-policy for the M/G/1 queue
  publication-title: Manag Sci
  doi: 10.1287/mnsc.23.7.775
– volume: 41
  start-page: 1267
  year: 2005
  end-page: 1277
  ident: CR14
  article-title: Modified T vacation policy for an M/G/1 queueing system with an un-reliable server and startup
  publication-title: Math Comput Model
  doi: 10.1016/j.mcm.2004.08.009
– volume: 14
  start-page: 393
  year: 1963
  end-page: 405
  ident: CR23
  article-title: Queueing systems with a removable service station
  publication-title: Oper Res Q
  doi: 10.1057/jors.1963.63
– volume: 22
  start-page: 1005
  year: 1995
  end-page: 1014
  ident: CR10
  article-title: Interrelationship between controlling arrival and service in queueing systems
  publication-title: Comput Oper Res
  doi: 10.1016/0305-0548(94)00088-P
– volume: 50
  start-page: 248
  year: 2006
  end-page: 262
  ident: CR16
  article-title: Optimal NT policies for M/G/1 system with a startup and unreliable server
  publication-title: Comput Ind Eng
  doi: 10.1016/j.cie.2006.04.004
– volume: 27
  start-page: 665
  year: 2003
  end-page: 675
  ident: CR12
  article-title: An analysis of the M/G/1 system with N and T policy
  publication-title: Appl Math Model
  doi: 10.1016/S0307-904X(03)00074-X
– volume: 10
  start-page: 131
  year: 2014
  end-page: 149
  ident: CR7
  article-title: The impact of the NT-policy on the behaviour of a discrete-time queue with general service times
  publication-title: J Ind Manag Optim
– volume: 10
  start-page: 57
  year: 1996
  end-page: 73
  ident: CR8
  article-title: Bicriterion optimization of an M/G/1 queue with a removable server
  publication-title: Probab Eng Inf Sci
  doi: 10.1017/S0269964800004174
– year: 1996
  ident: CR20
  publication-title: Stochastic processes
– volume: 214
  start-page: 814
  year: 2011
  end-page: 817
  ident: CR24
  article-title: Cost evaluation in M/G/1 queue with T-policy revisited, technical note
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2011.05.043
– year: 2010
  ident: CR17
  publication-title: Constructive computation in stochastic models with applications: the RG-factorizations
  doi: 10.1007/978-3-642-11492-2
– start-page: 1663
  year: 1990
  end-page: 1669
  ident: CR4
  article-title: NT-vacation policy for M/G/1 queue with starter
  publication-title: Communication, control, and signal processing
– volume: 6148
  start-page: 29
  year: 2010
  end-page: 43
  ident: CR6
  article-title: Analysis of a discrete-time queueing system with an NT-policy
  publication-title: Lect Notes Comput
  doi: 10.1007/978-3-642-13568-2_3
– volume: 25
  start-page: 652
  year: 2010
  end-page: 671
  ident: CR13
  article-title: Design strategy for optimizing power consumption of sensor node with Min(N, T) policy M/G/1 queuing models
  publication-title: Int J Commun Syst
  doi: 10.1002/dac.1288
– volume: 30
  start-page: 49
  year: 2006
  end-page: 66
  ident: CR15
  article-title: On M/G/1 system under NT policies with breakdowns, startup and closedown
  publication-title: Appl Math Model
  doi: 10.1016/j.apm.2005.03.022
– volume: 22
  start-page: 347
  year: 2008
  end-page: 354
  ident: CR19
  article-title: Moments of the duration of busy periods of /G/1/n systems
  publication-title: Probab Eng Inf Sci
  doi: 10.1017/S026996480800020X
– volume: 88
  start-page: 599
  year: 1996
  end-page: 613
  ident: CR1
  article-title: Discrete NT-policy single server queue with Markovian arrival process and phase type service
  publication-title: Eur J Oper Res
  doi: 10.1016/0377-2217(94)00206-1
– volume: 22
  start-page: 1005
  year: 1995
  ident: 190_CR10
  publication-title: Comput Oper Res
  doi: 10.1016/0305-0548(94)00088-P
– volume: 22
  start-page: 347
  year: 2008
  ident: 190_CR19
  publication-title: Probab Eng Inf Sci
  doi: 10.1017/S026996480800020X
– volume: 214
  start-page: 814
  year: 2011
  ident: 190_CR24
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2011.05.043
– volume: 1
  start-page: 29
  year: 1986
  ident: 190_CR5
  publication-title: Queueing Syst
  doi: 10.1007/BF01149327
– volume: 41
  start-page: 1267
  year: 2005
  ident: 190_CR14
  publication-title: Math Comput Model
  doi: 10.1016/j.mcm.2004.08.009
– volume-title: Stochastic processes
  year: 1996
  ident: 190_CR20
– volume: 6148
  start-page: 29
  year: 2010
  ident: 190_CR6
  publication-title: Lect Notes Comput
  doi: 10.1007/978-3-642-13568-2_3
– volume: 88
  start-page: 599
  year: 1996
  ident: 190_CR1
  publication-title: Eur J Oper Res
  doi: 10.1016/0377-2217(94)00206-1
– volume: 30
  start-page: 49
  year: 2006
  ident: 190_CR15
  publication-title: Appl Math Model
  doi: 10.1016/j.apm.2005.03.022
– volume-title: Constructive computation in stochastic models with applications: the RG-factorizations
  year: 2010
  ident: 190_CR17
– volume: 54
  start-page: 466
  year: 2003
  ident: 190_CR21
  publication-title: J Oper Res Soc
  doi: 10.1057/palgrave.jors.2601536
– volume: 14
  start-page: 393
  year: 1963
  ident: 190_CR23
  publication-title: Oper Res Q
  doi: 10.1057/jors.1963.63
– volume: 50
  start-page: 248
  year: 2006
  ident: 190_CR16
  publication-title: Comput Ind Eng
  doi: 10.1016/j.cie.2006.04.004
– volume: 27
  start-page: 665
  year: 2003
  ident: 190_CR12
  publication-title: Appl Math Model
  doi: 10.1016/S0307-904X(03)00074-X
– start-page: 1663
  volume-title: Communication, control, and signal processing
  year: 1990
  ident: 190_CR4
– volume: 10
  start-page: 131
  year: 2014
  ident: 190_CR7
  publication-title: J Ind Manag Optim
  doi: 10.3934/jimo.2014.10.131
– volume: 47
  start-page: 240
  year: 2000
  ident: 190_CR18
  publication-title: Naval Res Logist
  doi: 10.1002/(SICI)1520-6750(200004)47:3<240::AID-NAV4>3.0.CO;2-E
– volume: 10
  start-page: 57
  year: 1996
  ident: 190_CR8
  publication-title: Probab Eng Inf Sci
  doi: 10.1017/S0269964800004174
– volume: 42
  start-page: 265
  year: 2000
  ident: 190_CR2
  publication-title: Perform Eval
  doi: 10.1016/S0166-5316(00)00015-8
– volume: 1
  start-page: 1
  year: 2014
  ident: 190_CR22
  publication-title: Int J Supply Oper Manag
– volume: 23
  start-page: 775
  year: 1977
  ident: 190_CR11
  publication-title: Manag Sci
  doi: 10.1287/mnsc.23.7.775
– volume: 13
  start-page: 47
  year: 1995
  ident: 190_CR9
  publication-title: Stoch Anal Appl
  doi: 10.1080/07362999508809382
– volume: 25
  start-page: 652
  year: 2010
  ident: 190_CR13
  publication-title: Int J Commun Syst
  doi: 10.1002/dac.1288
– volume: 19
  start-page: 1013
  year: 1973
  ident: 190_CR3
  publication-title: Manag Sci
  doi: 10.1287/mnsc.19.9.1013
SSID ssj0000327848
ssib004298988
Score 2.0289772
Snippet The prime objective of this paper is to give some analysis results concerning the discrete-time finite-buffer NT -policy queue, which can be utilized to...
The prime objective of this paper is to give some analysis results concerning the discrete-time finite-buffer NT-policy queue, which can be utilized to...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 161
SubjectTerms Branching (mathematics)
Business and Management
Computational Intelligence
Computer engineering
Cost analysis
Customer services
Decomposition
Management Science
Markov analysis
Mathematical models
Operating costs
Operations Research
Operations Research/Decision Theory
Optimization
Original Paper
Policies
Queues
Queuing
Regeneration
Search methods
Servers
Studies
Vacations
SummonAdditionalLinks – databaseName: ABI/INFORM Collection
  dbid: 7WY
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NT9wwEB2VbQ_lAPQDEdgiV-qplVUnWePkhBAC9bRCgqr0FDn-kJB2N8tuwu9nxuuw20pw4ZJLnFjW2DPPHs97AN-E0Jm0vubKE6k2AgiOcV5zn_rSEueTkTqITajxuLi9La_igdsyXqvsfWJw1LYxdEb-EyNRSpy6WX46v-ekGkXZ1SihsQVvMVBLUjBQf_5u-tqip-MKnjmnNFuojkspsVDIok90hmq6LJe0t6bbbKXg4t9Qtcaf_6VMQyS63H3tGPZgJ2JQdraaNB_gjZt9hO0NZsJPML9upo7pyFjCcE_eTdol09GYzjI6wGWIHlmDTmcaqzlZ1KdhCIWZZlTyu0BUzknBnvk7wre87kiShY1v-DxwEjMcQec-w-_Li5vzXzyKM3CTq7zlTiG4sYXRGT5SJ8vUepFZXehcWuWFddaPnCm1T42ULiWaq0zVCA-8UBZx0D4MZs3MHQCrjSlzIp2hQ6hypHQAnbX2UjnpRnUCordDZSJzOQloTKo15zKZrkLTVWS6SiTw_emT-Yq246XGw95cVVzBy2ptqwS-Pr3GtUcJFT1zTUdtcuJXQwSdwI9-Umz84rkOD1_u8AjeIyw7WV0KHsKgXXTuC7wzD-3dcnEcpvgjPeQARg
  priority: 102
  providerName: ProQuest
Title Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue
URI https://link.springer.com/article/10.1007/s12351-015-0190-0
https://www.proquest.com/docview/1811906223
https://www.proquest.com/docview/1835563774
Volume 16
WOSCitedRecordID wos000380151400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1866-1505
  dateEnd: 20161231
  omitProxy: false
  ssIdentifier: ssj0000327848
  issn: 1109-2858
  databaseCode: 7WY
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1866-1505
  dateEnd: 20161231
  omitProxy: false
  ssIdentifier: ssj0000327848
  issn: 1109-2858
  databaseCode: M0C
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1866-1505
  dateEnd: 20161231
  omitProxy: false
  ssIdentifier: ssj0000327848
  issn: 1109-2858
  databaseCode: M7S
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1866-1505
  dateEnd: 20161231
  omitProxy: false
  ssIdentifier: ssj0000327848
  issn: 1109-2858
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: Springer Journals
  customDbUrl:
  eissn: 1866-1505
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000327848
  issn: 1109-2858
  databaseCode: RSV
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dT9swED8xugd4gPExrcAqI-2JyZKT1Dh5hKrVXlZVFFj3FDn-kCpBW7UNfz93qUPLtCGxF0tRHMc5x-ff-Xy_A_gmhI6l9QVXnki1EUBwXOc195HPLHE-GamrZBOq309Ho2wQ4rgX9Wn32iVZaep1sFucSDJ96bBZJjja6Q1JZDNkog_vNxVsWnNwVeo4Id9aFRIXkTchlWnt3fxbq6_XpzXo_MNPWi0_vf3_6vgn2Atok12tfo8D2HKTQ9jd4CA8gtlw-uiYDtwkDK3v8mG5YDoMm7OMtmoZ4kQ2RfXyGOI2WchEwxD0Ms0ouHeO-JtTrnrmx4RkeVFS8hXWv-Wzin2Y4UeW7hjuet3bzg8e0jBwk6hkyZ1CGGNTo2MsIiezyHoRW53qRFrlhXXWt53JtI-MlC4iQqtYFQgEvFAWEc9n2J5MJ-4LsMKYLCF6GdpuytpKV_Cy0F4qJ127aIKohZ-bwFFOqTIe8jW7MgkzR2HmJMxcNOHi5ZHZiqDjrcpn9YjmYa4ucsQ4EbE1x0kTzl9u4ywj14meuGlJdRJiUkOs3ITv9ShvNPGvF568q_Yp7CAeu1ydBj6D7eW8dF_ho3lajhfzFnxQv363oHHd7Q9u8Oqn6FCphq1qAjwDv3H53Q
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VggQcylssLWAkuIAsnGSNkwNCqFC1artCYpF6C449liq1m2WzAfGn-hs74026CxK99cAllzi2Yn-eh8fzDcBLpWyqfaikCUyqTQaEJD1vZUhC4ZnzyWkbi02Y0Sg_Oiq-rMFZnwvD1yp7mRgFta8dn5G_JU2UMKdumn2Y_pBcNYqjq30JjQUs9vH3L3LZmvd7n2h9X6Xpzufx9q7sqgpIl5lsLtGQVva5syk9EtRF4oNKvc1tpr0JyqMPQ3SFDYnTGhPmZ0pNRXotKONJgVO_1-D6kBwv3leHantVtuc9_VfUBBmH9WI2XsKBjFznfWA1Zu-lmWZfnm_PFUqqP1Xj0t79K0QbNd_Onf9tzu7CRmdji4-LTXEP1nByH26vMC8-gOnX-hSF7RhZxAyb9mTeCNuBFb3gA2pB1rGoSaiedtmqoqu_I8jUF1ZwSvOMvA5JLVCEY7bfZdVyyRkxGstp5FwWNGMtPoRvV_LLj2B9Uk_wMYjKuSJjUh0-ZCuGxkajurJBG9Q4rAag-nUvXcfMzgVCTsolpzRDpSSolAyVUg3g9cUn0wUtyWWNt3p4lJ2EasolNgbw4uI1yRYOGNkJ1i23yZg_jjyEAbzpQbjSxb8GfHL5gM_h5u748KA82Bvtb8ItMkHfLS5Ab8H6fNbiU7jhfs6Pm9mzuL0EfL9qbJ4DxNZe1Q
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VLUJw4I26UMBIcAFZdeI1Tg4IAe2KqihaQZF6C44fUqV2s91sQPw1fh0zWae7INFbD1xyieMozud5eGa-AXguhEmVCxXXgUi10YDgqOcND0nIHXE-WWW6ZhO6KLKjo3yyAb_6WhhKq-xlYieoXW3pjHwHNVFCnLqp3AkxLWKyO347O-PUQYoirX07jSVEDvzPH-i-NW_2d_Ffv0jT8d7hh488dhjgVmq54F6jhnaZNSleEq_yxAWROpMZqZwOwnkXRt7mJiRWKZ8QV1OqK9RxQWiHyhznvQKbWqLTM4DN93vF5PO6pM96MrBOL0gK8nW1eQmFNTKV9WHWrpYvlYo8e8qlywUXfyrKlfX7V8C204PjW__zCt6Gm9H6Zu-W2-UObPjpXbixxsl4D2Zf6lPPTORqYXPftCeLhpkIY-8YHV0ztJtZjeL2NNaxstiZh6ETwAyjYuc5-iMcR3gWjsmy51VLzWhYcchnHRszw9Vr_X34eimf_AAG03rqt4BV1uaS6Hbo-C0fadOZ25UJSnvlR9UQRI-B0kbOdmodclKu2KYJNiXCpiTYlGIIL88fmS0JSy4avN1DpYyyqylXOBnCs_PbKHUolGSmvm5pjCRmOfQdhvCqB-TaFP964cOLX_gUriEky0_7xcEjuI626etlZvQ2DBbz1j-Gq_b74riZP4l7jcG3ywbnb4y0aRM
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=Some+analysis+results+associated+with+the+optimization+problem+for+a+discrete-time+finite-buffer+NT-policy+queue&rft.jtitle=Operational+research&rft.au=Yu%2C+Miaomiao&rft.au=Alfa%2C+Attahiru+Sule&rft.date=2016-07-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=1109-2858&rft.eissn=1866-1505&rft.volume=16&rft.issue=2&rft.spage=161&rft.epage=179&rft_id=info:doi/10.1007%2Fs12351-015-0190-0&rft.externalDocID=10_1007_s12351_015_0190_0
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1109-2858&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1109-2858&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1109-2858&client=summon