Double-sided matching queues: Priority and impatient customers.
Saved in:
| Title: | Double-sided matching queues: Priority and impatient customers. |
|---|---|
| Authors: | Diamant, Adam1 (AUTHOR) adiamant@schulich.yorku.ca, Baron, Opher2 (AUTHOR) opher.baron@rotman.utoronto.ca |
| Source: | Operations Research Letters. May2019, Vol. 47 Issue 3, p219-224. 6p. |
| Subjects: | Poisson processes, Consumers, Markov processes |
| Abstract: | We analyze a double-sided queue with priority that serves patient customers and customers with zero patience (i.e., impatient customers). In a two-sided market, high and low priority customers arrive to one side and match with queued customers on the opposite side. Impatient customers match with queued patient customers; when there is no queue, they leave the system unmatched. All arrivals follow independent Poisson processes. We derive exact formulae for the stationary queue length distribution and several steady-state performance measures. [ABSTRACT FROM AUTHOR] |
| Copyright of Operations Research Letters is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 136345354 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Double-sided matching queues: Priority and impatient customers. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Diamant%2C+Adam%22">Diamant, Adam</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> adiamant@schulich.yorku.ca</i><br /><searchLink fieldCode="AR" term="%22Baron%2C+Opher%22">Baron, Opher</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> opher.baron@rotman.utoronto.ca</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Operations+Research+Letters%22">Operations Research Letters</searchLink>. May2019, Vol. 47 Issue 3, p219-224. 6p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Poisson+processes%22">Poisson processes</searchLink><br /><searchLink fieldCode="DE" term="%22Consumers%22">Consumers</searchLink><br /><searchLink fieldCode="DE" term="%22Markov+processes%22">Markov processes</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: We analyze a double-sided queue with priority that serves patient customers and customers with zero patience (i.e., impatient customers). In a two-sided market, high and low priority customers arrive to one side and match with queued customers on the opposite side. Impatient customers match with queued patient customers; when there is no queue, they leave the system unmatched. All arrivals follow independent Poisson processes. We derive exact formulae for the stationary queue length distribution and several steady-state performance measures. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Operations Research Letters is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=136345354 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.orl.2019.03.003 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 6 StartPage: 219 Subjects: – SubjectFull: Poisson processes Type: general – SubjectFull: Consumers Type: general – SubjectFull: Markov processes Type: general Titles: – TitleFull: Double-sided matching queues: Priority and impatient customers. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Diamant, Adam – PersonEntity: Name: NameFull: Baron, Opher IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 05 Text: May2019 Type: published Y: 2019 Identifiers: – Type: issn-print Value: 01676377 Numbering: – Type: volume Value: 47 – Type: issue Value: 3 Titles: – TitleFull: Operations Research Letters Type: main |
| ResultId | 1 |