A clearing system with impatient passengers: asymptotics and estimation in a bus stop model
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Kella, Offer | |
dc.contributor.author | Stadje, Wolfgang | |
dc.date.accessioned | 2021-12-23T16:08:26Z | - |
dc.date.available | 2021-12-23T16:08:26Z | - |
dc.date.issued | 2015 | |
dc.identifier.issn | 02570130 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/8297 | - |
dc.description.abstract | At some location buses stop to pick up the passengers waiting there and leave immediately, empty or occupied. Passenger arrival times as well as bus arrival times form independent renewal processes. Every passenger is willing to wait for a random amount of time before leaving, and every bus takes away all waiting passengers. For this pickup model, we study the distributions of the number of waiting passengers and of the individual sojourn times. The sojourn times lead to a Markov chain embedded in the superposition of the two underlying renewal arrival processes, for which we study its convergence toward stationarity. | |
dc.description.sponsorship | Israel Science FoundationIsrael Science Foundation [1462/13]; Vigevani Chair in Statistics; Deutsche ForschungsgemeinschaftGerman Research Foundation (DFG) [306/13-2]; We are very grateful to the reviewer and the associate editor for the careful reading and for important observations and corrections that improved the presentation of the paper. In particular, (12) was suggested by the associate editor and replaces a considerably more cumbersome derivation. Offer Kella was supported in part by Grant 1462/13 from the Israel Science Foundation and the Vigevani Chair in Statistics. Wolfgang Stadje was supported by Grant No. 306/13-2 of the Deutsche Forschungsgemeinschaft. | |
dc.language.iso | en | |
dc.publisher | SPRINGER | |
dc.relation.ispartof | QUEUEING SYSTEMS | |
dc.subject | Clearing system | |
dc.subject | Computer Science | |
dc.subject | Computer Science, Interdisciplinary Applications | |
dc.subject | Impatience | |
dc.subject | M/G/infinity | |
dc.subject | Operations Research & Management Science | |
dc.subject | Pickup problem | |
dc.subject | Rate of convergence | |
dc.subject | Strongly mixing | |
dc.title | A clearing system with impatient passengers: asymptotics and estimation in a bus stop model | |
dc.type | journal article | |
dc.identifier.doi | 10.1007/s11134-014-9425-7 | |
dc.identifier.isi | ISI:000353814100001 | |
dc.description.volume | 80 | |
dc.description.issue | 1-2 | |
dc.description.startpage | 1 | |
dc.description.endpage | 14 | |
dc.identifier.eissn | 15729443 | |
dc.publisher.place | VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS | |
dcterms.isPartOf.abbreviation | Queueing Syst. | |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.netid | StWo325 | - |
Seitenaufrufe
1
Letzte Woche
0
0
Letzter Monat
0
0
geprüft am 17.05.2024