{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:52:22Z","timestamp":1743054742128,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030271800"},{"type":"electronic","value":"9783030271817"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-27181-7_13","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"201-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Linear Programming Approach to Markov Reward Error Bounds for Queueing Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9378-4056","authenticated-orcid":false,"given":"Xinwei","family":"Bai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5820-7301","authenticated-orcid":false,"given":"Jasper","family":"Goseling","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,23]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-6377(92)90050-D","volume":"12","author":"J Abate","year":"1992","unstructured":"Abate, J., Whitt, W.: Numerical inversion of probability generating functions. Oper. Res. Lett. 12(4), 245\u2013251 (1992)","journal-title":"Oper. Res. Lett."},{"key":"13_CR2","unstructured":"Cohen, J.W., Boxma, O.J.: Boundary Value Problems in Queueing System Analysis. North Holland (1983)"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2307\/1427272","volume":"20","author":"NM van Dijk","year":"1988","unstructured":"van Dijk, N.M.: Perturbation theory for unbounded Markov reward processes with applications to queueing. Adv. Appl. Probab. 20(1), 99\u2013111 (1988)","journal-title":"Adv. Appl. Probab."},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0166-5316(88)90017-X","volume":"8","author":"NM van Dijk","year":"1988","unstructured":"van Dijk, N.M.: Simple bounds for queueing systems with breakdowns. Perform. Eval. 8(2), 117\u2013128 (1988)","journal-title":"Perform. Eval."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1018978823209","volume":"79","author":"NM van Dijk","year":"1998","unstructured":"van Dijk, N.M.: Bounds and error bounds for queueing networks. Ann. Oper. Res. 79, 295\u2013319 (1998)","journal-title":"Ann. Oper. Res."},{"key":"13_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6472-4_9","volume-title":"Queueing Networks: A Fundamental Approach, International Series in Operations Research & Management Science","author":"NM van Dijk","year":"2011","unstructured":"van Dijk, N.M.: Error bounds and comparison results: the Markov reward approach for queueing networks. In: Boucherie, R.J., van Dijk, N.M. (eds.) Queueing Networks: A Fundamental Approach, International Series in Operations Research & Management Science, vol. 154. Springer, Boston (2011). https:\/\/doi.org\/10.1007\/978-1-4419-6472-4_9"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/opre.36.3.470","volume":"36","author":"NM van Dijk","year":"1988","unstructured":"van Dijk, N.M., Lamond, B.F.: Simple bounds for finite single-server exponential tandem queues. Oper. Res. 36, 470\u2013477 (1988)","journal-title":"Oper. Res."},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1287\/moor.1040.0111","volume":"29","author":"NM van Dijk","year":"2004","unstructured":"van Dijk, N.M., Miyazawa, M.: Error bounds for perturbing nonexponential queues. Math. Oper. Res. 29(3), 525\u2013558 (2004)","journal-title":"Math. Oper. Res."},{"key":"13_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60001-2","volume-title":"Random Walks in the Quarter-Plane: Algebraic Methods, Boundary Value Problems and Applications","author":"G Fayolle","year":"1999","unstructured":"Fayolle, G., Iasnogorodski, R., Malyshev, V.A.: Random Walks in the Quarter-Plane: Algebraic Methods, Boundary Value Problems and Applications, vol. 40. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-60001-2"},{"issue":"5","key":"13_CR10","first-page":"757","volume":"52","author":"J Goseling","year":"2016","unstructured":"Goseling, J., Boucherie, R.J., van Ommeren, J.C.W.: A linear programming approach to error bounds for random walks in the quarter-plane. Kybernetika 52(5), 757\u2013784 (2016)","journal-title":"Kybernetika"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0305-0548(77)90007-7","volume":"4","author":"WK Grassmann","year":"1977","unstructured":"Grassmann, W.K.: Transient solutions in Markovian queueing systems. Comput. Oper. Res. 4(1), 47\u201353 (1977)","journal-title":"Comput. Oper. Res."},{"key":"13_CR12","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2018). http:\/\/www.gurobi.com"},{"key":"13_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58821-6","volume-title":"Pyomo\u2013Optimization Modeling in Python","author":"WE Hart","year":"2017","unstructured":"Hart, W.E., et al.: Pyomo\u2013Optimization Modeling in Python, vol. 67, 2nd edn. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58821-6","edition":"2"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1287\/opre.5.4.518","volume":"5","author":"JR Jackson","year":"1957","unstructured":"Jackson, J.R.: Networks of waiting lines. Oper. Res. 5(4), 518\u2013521 (1957)","journal-title":"Oper. Res."},{"key":"13_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial Optimization","author":"B Korte","year":"2012","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization, vol. 12. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-24488-9"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling, vol. 5. SIAM (1999)","DOI":"10.1137\/1.9780898719734"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Masuyama, H., Sakuma, Y., Kobayashi, M.: Simple error bounds for the QBD approximation of a special class of two dimensional reflecting random walks. In: Proceedings of the 11th International Conference on Queueing Theory and Network Applications, p. 23. ACM (2016)","DOI":"10.1145\/3016032.3016048"},{"key":"13_CR18","unstructured":"Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Dover Publications (1981)"},{"issue":"5","key":"13_CR19","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/S0167-6377(03)00046-4","volume":"31","author":"J Resing","year":"2003","unstructured":"Resing, J., \u00d6rmeci, L.: A tandem queueing model with coupled processors. Oper. Res. Lett. 31(5), 383\u2013389 (2003)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Queueing Theory and Network Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27181-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:24:07Z","timestamp":1710350647000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27181-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271800","9783030271817"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27181-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QTNA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Queueing Theory and Network Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qtna2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/qtna2019.ugent.be\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}