Analysis of a discrete-time queue with time-limited overtake priority
In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The two classes of customers have different priority levels in the queue, and different service-time dis...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
De Clercq, Sofian [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2016 |
|---|
| Rechteinformationen: |
Nutzungsrecht: © Springer Science+Business Media New York 2016 |
|---|
| Schlagwörter: |
Operation Research/Decision Theory |
|---|
| Übergeordnetes Werk: |
Enthalten in: Annals of operations research - Dordrecht, The Netherlands : Springer Nature B.V., 1984, 238(2016), 1, Seite 69-97 |
|---|---|
| Übergeordnetes Werk: |
volume:238 ; year:2016 ; number:1 ; pages:69-97 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10479-015-2000-8 |
|---|
| Katalog-ID: |
OLC1973059231 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1973059231 | ||
| 003 | DE-627 | ||
| 005 | 20230714184034.0 | ||
| 007 | tu | ||
| 008 | 160427s2016 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10479-015-2000-8 |2 doi | |
| 028 | 5 | 2 | |a PQ20160430 |
| 035 | |a (DE-627)OLC1973059231 | ||
| 035 | |a (DE-599)GBVOLC1973059231 | ||
| 035 | |a (PRQ)p950-c93c8ec2ed05ddc35a5cf05250a332330c121a8d635cf119292188a79359c8880 | ||
| 035 | |a (KEY)0133795520160000238000100069analysisofadiscretetimequeuewithtimelimitedovertak | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q DNB |
| 100 | 1 | |a De Clercq, Sofian |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Analysis of a discrete-time queue with time-limited overtake priority |
| 264 | 1 | |c 2016 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The two classes of customers have different priority levels in the queue, and different service-time distributions. The studied priority mechanism is time-limited, i.e., customers of the high-priority class cannot overtake customers of lower priority if the latter arrived at least N slots earlier than the former. The parameter N makes the mechanism versatile, spanning a bridge between absolute (fixed) priority and slot-bound priority (see De Clercq et al. in Math Probl Eng. doi: 10.1155/2012/425630 , 2012). The time-limited overtake priority mechanism maintains levels of fairness that are unattainable by a pure absolute priority mechanism, and offers more service differentiation than the slot-bound priority alternative studied earlier. By using a censoring argument, we obtain expressions for the steady-state probability generating functions of the delays of both customer classes, as well as the steady-state joint probability generating function of the system content, by using a censoring argument. | ||
| 540 | |a Nutzungsrecht: © Springer Science+Business Media New York 2016 | ||
| 650 | 4 | |a Priority jumps | |
| 650 | 4 | |a Operation Research/Decision Theory | |
| 650 | 4 | |a Dynamic priority | |
| 650 | 4 | |a Probability generating function | |
| 650 | 4 | |a Censored Markov chains | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Business and Management | |
| 650 | 4 | |a Earliest-due-date | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Queueing theory | |
| 650 | 4 | |a Slot-bound priority | |
| 650 | 4 | |a Priority | |
| 650 | 4 | |a Queuing theory | |
| 650 | 4 | |a Studies | |
| 650 | 4 | |a Operations research | |
| 700 | 1 | |a Steyaert, Bart |4 oth | |
| 700 | 1 | |a Wittevrongel, Sabine |4 oth | |
| 700 | 1 | |a Bruneel, Herwig |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t Annals of operations research |d Dordrecht, The Netherlands : Springer Nature B.V., 1984 |g 238(2016), 1, Seite 69-97 |w (DE-627)12964370X |w (DE-600)252629-3 |w (DE-576)018141862 |x 0254-5330 |
| 773 | 1 | 8 | |g volume:238 |g year:2016 |g number:1 |g pages:69-97 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1007/s10479-015-2000-8 |3 Volltext |
| 856 | 4 | 2 | |u http://search.proquest.com/docview/1771108385 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OLC-MAT | ||
| 951 | |a AR | ||
| 952 | |d 238 |j 2016 |e 1 |h 69-97 | ||
| author_variant |
c s d cs csd |
|---|---|
| matchkey_str |
article:02545330:2016----::nlssfdsrttmqeeihieiie |
| hierarchy_sort_str |
2016 |
| publishDate |
2016 |
| allfields |
10.1007/s10479-015-2000-8 doi PQ20160430 (DE-627)OLC1973059231 (DE-599)GBVOLC1973059231 (PRQ)p950-c93c8ec2ed05ddc35a5cf05250a332330c121a8d635cf119292188a79359c8880 (KEY)0133795520160000238000100069analysisofadiscretetimequeuewithtimelimitedovertak DE-627 ger DE-627 rakwb eng 004 DNB De Clercq, Sofian verfasserin aut Analysis of a discrete-time queue with time-limited overtake priority 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The two classes of customers have different priority levels in the queue, and different service-time distributions. The studied priority mechanism is time-limited, i.e., customers of the high-priority class cannot overtake customers of lower priority if the latter arrived at least N slots earlier than the former. The parameter N makes the mechanism versatile, spanning a bridge between absolute (fixed) priority and slot-bound priority (see De Clercq et al. in Math Probl Eng. doi: 10.1155/2012/425630 , 2012). The time-limited overtake priority mechanism maintains levels of fairness that are unattainable by a pure absolute priority mechanism, and offers more service differentiation than the slot-bound priority alternative studied earlier. By using a censoring argument, we obtain expressions for the steady-state probability generating functions of the delays of both customer classes, as well as the steady-state joint probability generating function of the system content, by using a censoring argument. Nutzungsrecht: © Springer Science+Business Media New York 2016 Priority jumps Operation Research/Decision Theory Dynamic priority Probability generating function Censored Markov chains Combinatorics Business and Management Earliest-due-date Theory of Computation Queueing theory Slot-bound priority Priority Queuing theory Studies Operations research Steyaert, Bart oth Wittevrongel, Sabine oth Bruneel, Herwig oth Enthalten in Annals of operations research Dordrecht, The Netherlands : Springer Nature B.V., 1984 238(2016), 1, Seite 69-97 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:238 year:2016 number:1 pages:69-97 http://dx.doi.org/10.1007/s10479-015-2000-8 Volltext http://search.proquest.com/docview/1771108385 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 238 2016 1 69-97 |
| spelling |
10.1007/s10479-015-2000-8 doi PQ20160430 (DE-627)OLC1973059231 (DE-599)GBVOLC1973059231 (PRQ)p950-c93c8ec2ed05ddc35a5cf05250a332330c121a8d635cf119292188a79359c8880 (KEY)0133795520160000238000100069analysisofadiscretetimequeuewithtimelimitedovertak DE-627 ger DE-627 rakwb eng 004 DNB De Clercq, Sofian verfasserin aut Analysis of a discrete-time queue with time-limited overtake priority 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The two classes of customers have different priority levels in the queue, and different service-time distributions. The studied priority mechanism is time-limited, i.e., customers of the high-priority class cannot overtake customers of lower priority if the latter arrived at least N slots earlier than the former. The parameter N makes the mechanism versatile, spanning a bridge between absolute (fixed) priority and slot-bound priority (see De Clercq et al. in Math Probl Eng. doi: 10.1155/2012/425630 , 2012). The time-limited overtake priority mechanism maintains levels of fairness that are unattainable by a pure absolute priority mechanism, and offers more service differentiation than the slot-bound priority alternative studied earlier. By using a censoring argument, we obtain expressions for the steady-state probability generating functions of the delays of both customer classes, as well as the steady-state joint probability generating function of the system content, by using a censoring argument. Nutzungsrecht: © Springer Science+Business Media New York 2016 Priority jumps Operation Research/Decision Theory Dynamic priority Probability generating function Censored Markov chains Combinatorics Business and Management Earliest-due-date Theory of Computation Queueing theory Slot-bound priority Priority Queuing theory Studies Operations research Steyaert, Bart oth Wittevrongel, Sabine oth Bruneel, Herwig oth Enthalten in Annals of operations research Dordrecht, The Netherlands : Springer Nature B.V., 1984 238(2016), 1, Seite 69-97 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:238 year:2016 number:1 pages:69-97 http://dx.doi.org/10.1007/s10479-015-2000-8 Volltext http://search.proquest.com/docview/1771108385 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 238 2016 1 69-97 |
| allfields_unstemmed |
10.1007/s10479-015-2000-8 doi PQ20160430 (DE-627)OLC1973059231 (DE-599)GBVOLC1973059231 (PRQ)p950-c93c8ec2ed05ddc35a5cf05250a332330c121a8d635cf119292188a79359c8880 (KEY)0133795520160000238000100069analysisofadiscretetimequeuewithtimelimitedovertak DE-627 ger DE-627 rakwb eng 004 DNB De Clercq, Sofian verfasserin aut Analysis of a discrete-time queue with time-limited overtake priority 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The two classes of customers have different priority levels in the queue, and different service-time distributions. The studied priority mechanism is time-limited, i.e., customers of the high-priority class cannot overtake customers of lower priority if the latter arrived at least N slots earlier than the former. The parameter N makes the mechanism versatile, spanning a bridge between absolute (fixed) priority and slot-bound priority (see De Clercq et al. in Math Probl Eng. doi: 10.1155/2012/425630 , 2012). The time-limited overtake priority mechanism maintains levels of fairness that are unattainable by a pure absolute priority mechanism, and offers more service differentiation than the slot-bound priority alternative studied earlier. By using a censoring argument, we obtain expressions for the steady-state probability generating functions of the delays of both customer classes, as well as the steady-state joint probability generating function of the system content, by using a censoring argument. Nutzungsrecht: © Springer Science+Business Media New York 2016 Priority jumps Operation Research/Decision Theory Dynamic priority Probability generating function Censored Markov chains Combinatorics Business and Management Earliest-due-date Theory of Computation Queueing theory Slot-bound priority Priority Queuing theory Studies Operations research Steyaert, Bart oth Wittevrongel, Sabine oth Bruneel, Herwig oth Enthalten in Annals of operations research Dordrecht, The Netherlands : Springer Nature B.V., 1984 238(2016), 1, Seite 69-97 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:238 year:2016 number:1 pages:69-97 http://dx.doi.org/10.1007/s10479-015-2000-8 Volltext http://search.proquest.com/docview/1771108385 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 238 2016 1 69-97 |
| allfieldsGer |
10.1007/s10479-015-2000-8 doi PQ20160430 (DE-627)OLC1973059231 (DE-599)GBVOLC1973059231 (PRQ)p950-c93c8ec2ed05ddc35a5cf05250a332330c121a8d635cf119292188a79359c8880 (KEY)0133795520160000238000100069analysisofadiscretetimequeuewithtimelimitedovertak DE-627 ger DE-627 rakwb eng 004 DNB De Clercq, Sofian verfasserin aut Analysis of a discrete-time queue with time-limited overtake priority 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The two classes of customers have different priority levels in the queue, and different service-time distributions. The studied priority mechanism is time-limited, i.e., customers of the high-priority class cannot overtake customers of lower priority if the latter arrived at least N slots earlier than the former. The parameter N makes the mechanism versatile, spanning a bridge between absolute (fixed) priority and slot-bound priority (see De Clercq et al. in Math Probl Eng. doi: 10.1155/2012/425630 , 2012). The time-limited overtake priority mechanism maintains levels of fairness that are unattainable by a pure absolute priority mechanism, and offers more service differentiation than the slot-bound priority alternative studied earlier. By using a censoring argument, we obtain expressions for the steady-state probability generating functions of the delays of both customer classes, as well as the steady-state joint probability generating function of the system content, by using a censoring argument. Nutzungsrecht: © Springer Science+Business Media New York 2016 Priority jumps Operation Research/Decision Theory Dynamic priority Probability generating function Censored Markov chains Combinatorics Business and Management Earliest-due-date Theory of Computation Queueing theory Slot-bound priority Priority Queuing theory Studies Operations research Steyaert, Bart oth Wittevrongel, Sabine oth Bruneel, Herwig oth Enthalten in Annals of operations research Dordrecht, The Netherlands : Springer Nature B.V., 1984 238(2016), 1, Seite 69-97 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:238 year:2016 number:1 pages:69-97 http://dx.doi.org/10.1007/s10479-015-2000-8 Volltext http://search.proquest.com/docview/1771108385 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 238 2016 1 69-97 |
| allfieldsSound |
10.1007/s10479-015-2000-8 doi PQ20160430 (DE-627)OLC1973059231 (DE-599)GBVOLC1973059231 (PRQ)p950-c93c8ec2ed05ddc35a5cf05250a332330c121a8d635cf119292188a79359c8880 (KEY)0133795520160000238000100069analysisofadiscretetimequeuewithtimelimitedovertak DE-627 ger DE-627 rakwb eng 004 DNB De Clercq, Sofian verfasserin aut Analysis of a discrete-time queue with time-limited overtake priority 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The two classes of customers have different priority levels in the queue, and different service-time distributions. The studied priority mechanism is time-limited, i.e., customers of the high-priority class cannot overtake customers of lower priority if the latter arrived at least N slots earlier than the former. The parameter N makes the mechanism versatile, spanning a bridge between absolute (fixed) priority and slot-bound priority (see De Clercq et al. in Math Probl Eng. doi: 10.1155/2012/425630 , 2012). The time-limited overtake priority mechanism maintains levels of fairness that are unattainable by a pure absolute priority mechanism, and offers more service differentiation than the slot-bound priority alternative studied earlier. By using a censoring argument, we obtain expressions for the steady-state probability generating functions of the delays of both customer classes, as well as the steady-state joint probability generating function of the system content, by using a censoring argument. Nutzungsrecht: © Springer Science+Business Media New York 2016 Priority jumps Operation Research/Decision Theory Dynamic priority Probability generating function Censored Markov chains Combinatorics Business and Management Earliest-due-date Theory of Computation Queueing theory Slot-bound priority Priority Queuing theory Studies Operations research Steyaert, Bart oth Wittevrongel, Sabine oth Bruneel, Herwig oth Enthalten in Annals of operations research Dordrecht, The Netherlands : Springer Nature B.V., 1984 238(2016), 1, Seite 69-97 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:238 year:2016 number:1 pages:69-97 http://dx.doi.org/10.1007/s10479-015-2000-8 Volltext http://search.proquest.com/docview/1771108385 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 238 2016 1 69-97 |
| language |
English |
| source |
Enthalten in Annals of operations research 238(2016), 1, Seite 69-97 volume:238 year:2016 number:1 pages:69-97 |
| sourceStr |
Enthalten in Annals of operations research 238(2016), 1, Seite 69-97 volume:238 year:2016 number:1 pages:69-97 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Priority jumps Operation Research/Decision Theory Dynamic priority Probability generating function Censored Markov chains Combinatorics Business and Management Earliest-due-date Theory of Computation Queueing theory Slot-bound priority Priority Queuing theory Studies Operations research |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Annals of operations research |
| authorswithroles_txt_mv |
De Clercq, Sofian @@aut@@ Steyaert, Bart @@oth@@ Wittevrongel, Sabine @@oth@@ Bruneel, Herwig @@oth@@ |
| publishDateDaySort_date |
2016-01-01T00:00:00Z |
| hierarchy_top_id |
12964370X |
| dewey-sort |
14 |
| id |
OLC1973059231 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1973059231</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230714184034.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160427s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-015-2000-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160430</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1973059231</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1973059231</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)p950-c93c8ec2ed05ddc35a5cf05250a332330c121a8d635cf119292188a79359c8880</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0133795520160000238000100069analysisofadiscretetimequeuewithtimelimitedovertak</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">De Clercq, Sofian</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Analysis of a discrete-time queue with time-limited overtake priority</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The two classes of customers have different priority levels in the queue, and different service-time distributions. The studied priority mechanism is time-limited, i.e., customers of the high-priority class cannot overtake customers of lower priority if the latter arrived at least N slots earlier than the former. The parameter N makes the mechanism versatile, spanning a bridge between absolute (fixed) priority and slot-bound priority (see De Clercq et al. in Math Probl Eng. doi: 10.1155/2012/425630 , 2012). The time-limited overtake priority mechanism maintains levels of fairness that are unattainable by a pure absolute priority mechanism, and offers more service differentiation than the slot-bound priority alternative studied earlier. By using a censoring argument, we obtain expressions for the steady-state probability generating functions of the delays of both customer classes, as well as the steady-state joint probability generating function of the system content, by using a censoring argument.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © Springer Science+Business Media New York 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Priority jumps</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operation Research/Decision Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic priority</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probability generating function</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Censored Markov chains</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Business and Management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Earliest-due-date</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queueing theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Slot-bound priority</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Priority</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queuing theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Studies</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Steyaert, Bart</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wittevrongel, Sabine</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bruneel, Herwig</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Dordrecht, The Netherlands : Springer Nature B.V., 1984</subfield><subfield code="g">238(2016), 1, Seite 69-97</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:238</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:69-97</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1007/s10479-015-2000-8</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1771108385</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">238</subfield><subfield code="j">2016</subfield><subfield code="e">1</subfield><subfield code="h">69-97</subfield></datafield></record></collection>
|
| author |
De Clercq, Sofian |
| spellingShingle |
De Clercq, Sofian ddc 004 misc Priority jumps misc Operation Research/Decision Theory misc Dynamic priority misc Probability generating function misc Censored Markov chains misc Combinatorics misc Business and Management misc Earliest-due-date misc Theory of Computation misc Queueing theory misc Slot-bound priority misc Priority misc Queuing theory misc Studies misc Operations research Analysis of a discrete-time queue with time-limited overtake priority |
| authorStr |
De Clercq, Sofian |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)12964370X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0254-5330 |
| topic_title |
004 DNB Analysis of a discrete-time queue with time-limited overtake priority Priority jumps Operation Research/Decision Theory Dynamic priority Probability generating function Censored Markov chains Combinatorics Business and Management Earliest-due-date Theory of Computation Queueing theory Slot-bound priority Priority Queuing theory Studies Operations research |
| topic |
ddc 004 misc Priority jumps misc Operation Research/Decision Theory misc Dynamic priority misc Probability generating function misc Censored Markov chains misc Combinatorics misc Business and Management misc Earliest-due-date misc Theory of Computation misc Queueing theory misc Slot-bound priority misc Priority misc Queuing theory misc Studies misc Operations research |
| topic_unstemmed |
ddc 004 misc Priority jumps misc Operation Research/Decision Theory misc Dynamic priority misc Probability generating function misc Censored Markov chains misc Combinatorics misc Business and Management misc Earliest-due-date misc Theory of Computation misc Queueing theory misc Slot-bound priority misc Priority misc Queuing theory misc Studies misc Operations research |
| topic_browse |
ddc 004 misc Priority jumps misc Operation Research/Decision Theory misc Dynamic priority misc Probability generating function misc Censored Markov chains misc Combinatorics misc Business and Management misc Earliest-due-date misc Theory of Computation misc Queueing theory misc Slot-bound priority misc Priority misc Queuing theory misc Studies misc Operations research |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
b s bs s w sw h b hb |
| hierarchy_parent_title |
Annals of operations research |
| hierarchy_parent_id |
12964370X |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Annals of operations research |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 |
| title |
Analysis of a discrete-time queue with time-limited overtake priority |
| ctrlnum |
(DE-627)OLC1973059231 (DE-599)GBVOLC1973059231 (PRQ)p950-c93c8ec2ed05ddc35a5cf05250a332330c121a8d635cf119292188a79359c8880 (KEY)0133795520160000238000100069analysisofadiscretetimequeuewithtimelimitedovertak |
| title_full |
Analysis of a discrete-time queue with time-limited overtake priority |
| author_sort |
De Clercq, Sofian |
| journal |
Annals of operations research |
| journalStr |
Annals of operations research |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2016 |
| contenttype_str_mv |
txt |
| container_start_page |
69 |
| author_browse |
De Clercq, Sofian |
| container_volume |
238 |
| class |
004 DNB |
| format_se |
Aufsätze |
| author-letter |
De Clercq, Sofian |
| doi_str_mv |
10.1007/s10479-015-2000-8 |
| dewey-full |
004 |
| title_sort |
analysis of a discrete-time queue with time-limited overtake priority |
| title_auth |
Analysis of a discrete-time queue with time-limited overtake priority |
| abstract |
In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The two classes of customers have different priority levels in the queue, and different service-time distributions. The studied priority mechanism is time-limited, i.e., customers of the high-priority class cannot overtake customers of lower priority if the latter arrived at least N slots earlier than the former. The parameter N makes the mechanism versatile, spanning a bridge between absolute (fixed) priority and slot-bound priority (see De Clercq et al. in Math Probl Eng. doi: 10.1155/2012/425630 , 2012). The time-limited overtake priority mechanism maintains levels of fairness that are unattainable by a pure absolute priority mechanism, and offers more service differentiation than the slot-bound priority alternative studied earlier. By using a censoring argument, we obtain expressions for the steady-state probability generating functions of the delays of both customer classes, as well as the steady-state joint probability generating function of the system content, by using a censoring argument. |
| abstractGer |
In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The two classes of customers have different priority levels in the queue, and different service-time distributions. The studied priority mechanism is time-limited, i.e., customers of the high-priority class cannot overtake customers of lower priority if the latter arrived at least N slots earlier than the former. The parameter N makes the mechanism versatile, spanning a bridge between absolute (fixed) priority and slot-bound priority (see De Clercq et al. in Math Probl Eng. doi: 10.1155/2012/425630 , 2012). The time-limited overtake priority mechanism maintains levels of fairness that are unattainable by a pure absolute priority mechanism, and offers more service differentiation than the slot-bound priority alternative studied earlier. By using a censoring argument, we obtain expressions for the steady-state probability generating functions of the delays of both customer classes, as well as the steady-state joint probability generating function of the system content, by using a censoring argument. |
| abstract_unstemmed |
In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The two classes of customers have different priority levels in the queue, and different service-time distributions. The studied priority mechanism is time-limited, i.e., customers of the high-priority class cannot overtake customers of lower priority if the latter arrived at least N slots earlier than the former. The parameter N makes the mechanism versatile, spanning a bridge between absolute (fixed) priority and slot-bound priority (see De Clercq et al. in Math Probl Eng. doi: 10.1155/2012/425630 , 2012). The time-limited overtake priority mechanism maintains levels of fairness that are unattainable by a pure absolute priority mechanism, and offers more service differentiation than the slot-bound priority alternative studied earlier. By using a censoring argument, we obtain expressions for the steady-state probability generating functions of the delays of both customer classes, as well as the steady-state joint probability generating function of the system content, by using a censoring argument. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT |
| container_issue |
1 |
| title_short |
Analysis of a discrete-time queue with time-limited overtake priority |
| url |
http://dx.doi.org/10.1007/s10479-015-2000-8 http://search.proquest.com/docview/1771108385 |
| remote_bool |
false |
| author2 |
Steyaert, Bart Wittevrongel, Sabine Bruneel, Herwig |
| author2Str |
Steyaert, Bart Wittevrongel, Sabine Bruneel, Herwig |
| ppnlink |
12964370X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth |
| doi_str |
10.1007/s10479-015-2000-8 |
| up_date |
2024-07-04T01:30:06.810Z |
| _version_ |
1803610076542402560 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1973059231</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230714184034.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160427s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-015-2000-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160430</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1973059231</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1973059231</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)p950-c93c8ec2ed05ddc35a5cf05250a332330c121a8d635cf119292188a79359c8880</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0133795520160000238000100069analysisofadiscretetimequeuewithtimelimitedovertak</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">De Clercq, Sofian</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Analysis of a discrete-time queue with time-limited overtake priority</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In this paper, we investigate a single-server discrete-time queueing system subject to two independent batch Bernoulli arrival processes, each supplying the queue with different customer classes. The two classes of customers have different priority levels in the queue, and different service-time distributions. The studied priority mechanism is time-limited, i.e., customers of the high-priority class cannot overtake customers of lower priority if the latter arrived at least N slots earlier than the former. The parameter N makes the mechanism versatile, spanning a bridge between absolute (fixed) priority and slot-bound priority (see De Clercq et al. in Math Probl Eng. doi: 10.1155/2012/425630 , 2012). The time-limited overtake priority mechanism maintains levels of fairness that are unattainable by a pure absolute priority mechanism, and offers more service differentiation than the slot-bound priority alternative studied earlier. By using a censoring argument, we obtain expressions for the steady-state probability generating functions of the delays of both customer classes, as well as the steady-state joint probability generating function of the system content, by using a censoring argument.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © Springer Science+Business Media New York 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Priority jumps</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operation Research/Decision Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic priority</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Probability generating function</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Censored Markov chains</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Business and Management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Earliest-due-date</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queueing theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Slot-bound priority</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Priority</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queuing theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Studies</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Steyaert, Bart</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wittevrongel, Sabine</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bruneel, Herwig</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Dordrecht, The Netherlands : Springer Nature B.V., 1984</subfield><subfield code="g">238(2016), 1, Seite 69-97</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:238</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:69-97</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1007/s10479-015-2000-8</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1771108385</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">238</subfield><subfield code="j">2016</subfield><subfield code="e">1</subfield><subfield code="h">69-97</subfield></datafield></record></collection>
|
| score |
7.40088 |