Approximation algorithms for stochastic online matching with reusable resources
We consider a class of stochastic online matching problems, where a set of sequentially arriving jobs are to be matched to a group of workers. The objective is to maximize the total expected reward, defined as the sum of the rewards of each matched worker-job pair. Each worker can be matched to mult...
Saved in:
| Published in | Mathematical methods of operations research (Heidelberg, Germany) Vol. 98; no. 1; pp. 43 - 56 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.08.2023
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1432-2994 1432-5217 |
| DOI | 10.1007/s00186-023-00822-3 |
Cover
Loading…
| Abstract | We consider a class of stochastic online matching problems, where a set of sequentially arriving jobs are to be matched to a group of workers. The objective is to maximize the total expected reward, defined as the sum of the rewards of each matched worker-job pair. Each worker can be matched to multiple jobs subject to the constraint that previously matched jobs are completed. We provide constant approximation algorithms for different variations of this problem with equal-length jobs. |
|---|---|
| AbstractList | We consider a class of stochastic online matching problems, where a set of sequentially arriving jobs are to be matched to a group of workers. The objective is to maximize the total expected reward, defined as the sum of the rewards of each matched worker-job pair. Each worker can be matched to multiple jobs subject to the constraint that previously matched jobs are completed. We provide constant approximation algorithms for different variations of this problem with equal-length jobs. |
| Author | Jacobson, Sheldon H. Yu, Ge Shanks, Meghan |
| Author_xml | – sequence: 1 givenname: Meghan orcidid: 0000-0003-4890-1302 surname: Shanks fullname: Shanks, Meghan email: meghans2@illinois.edu organization: Dept. Of Computer Science, University of Illinois at Urbana-Champaign – sequence: 2 givenname: Ge surname: Yu fullname: Yu, Ge organization: Amazon Inc – sequence: 3 givenname: Sheldon H. surname: Jacobson fullname: Jacobson, Sheldon H. organization: Dept. Of Computer Science, University of Illinois at Urbana-Champaign |
| BookMark | eNp9kE9PAjEQxRuDiYB-AU-beK5Op2W7eyTEfwkJFz033dLCkqXFdon67S0uiTdP8w6_N_PmTcjIB28JuWVwzwDkQwJgVUkBOQWoECm_IGMmONIZMjk6a6xrcUUmKe0g80LgmKzmh0MMX-1e923whe42Ibb9dp8KF2KR-mC2OvWtKYLvWm-LzJlt6zfFZ6aKaI9JN53NIoVjNDZdk0unu2RvznNK3p8e3xYvdLl6fl3Ml9TwEno6E3UttVwLC6VDqFgjpZFcaMuFY7IU66rB0sg1VjNnHNNgUdfY5MyNRIF8Su6GvTn9x9GmXu1yAJ9PqmwRpawZ8EzhQJkYUorWqUPMr8ZvxUCdilNDcSoXp36LUycTH0wpw35j49_qf1w_IwVyzw |
| Cites_doi | 10.1080/07408170802510416 10.1080/24725854.2018.1516054 10.1016/S0304-405X(97)00009-3 10.1287/opre.1090.0778 10.1287/mnsc.21.1.60 10.1002/9780470182963 10.1016/j.ypmed.2016.03.018 10.1287/opre.1040.0180 10.1090/S0002-9904-1977-14378-4 10.1002/nav.21611 10.1287/moor.11.2.230 10.1007/978-3-662-48350-3_53 10.1007/s10878-007-9131-z 10.1287/moor.1120.0551 10.1007/s11590-017-1191-0 10.1287/mnsc.18.7.349 10.1287/moor.11.4.619 10.1016/S0167-6377(98)00019-4 10.1016/0304-3975(94)90150-3 10.1002/nav.3800230114 10.1016/j.ejor.2017.09.006 10.1287/moor.2019.0993 10.1016/j.pmcj.2015.10.008 10.1109/FOCS.2009.72 10.1145/1993636.1993716 10.1002/9781118625651 10.1007/978-3-642-40450-4_50 10.1145/3489048.3530960 |
| ContentType | Journal Article |
| Copyright | The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| Copyright_xml | – notice: The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
| DBID | AAYXX CITATION 3V. 7SC 7TB 7WY 7WZ 7XB 87Z 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- KR7 L.- L6V L7M L~C L~D M0C M0N M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1007/s00186-023-00822-3 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Aerospace Collection ProQuest Central Essentials Local Electronic Collection Information ProQuest Central Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Korea Engineering Research Database Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database (ProQuest) Civil Engineering Abstracts ABI/INFORM Professional Advanced ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Engineering Database (ProQuest) Advanced Technologies & Aerospace Database (ProQuest) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) Civil Engineering Abstracts ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics Computer Science Business |
| EISSN | 1432-5217 |
| EndPage | 56 |
| ExternalDocumentID | 10_1007_s00186_023_00822_3 |
| GrantInformation_xml | – fundername: Air Force Office of Scientific Research grantid: FA9550-19-1-0106 funderid: http://dx.doi.org/10.13039/100000181 |
| GroupedDBID | -4X -52 -5D -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 203 28- 29M 29R 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 7WY 8AO 8FE 8FG 8FL 8TC 8UJ 8VB 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACYUM ACZOJ ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBA EBE EBLON EBO EBR EBS EBU ECS EDO EIOEI EJD EMK EOH EPL ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F IHE IJ- IKXTQ ITM IWAJR IXC IXE IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV KOW L6V LAS LLZTM M0C M0N M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O-J O9- O93 O9G O9I O9J OAM P19 P2P P62 P9R PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS QWB R-Y R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCF SCLPG SDD SDH SDM SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TH9 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7X Z7Z Z81 Z83 Z86 Z88 Z8M Z8R Z8T Z8U Z8W Z92 ZL0 ZMTXR ZWQNP ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ACSTC ADHKG ADXHL AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT 7SC 7TB 7XB 8AL 8FD 8FK ABRTQ FR3 JQ2 KR7 L.- L7M L~C L~D PKEHL PQEST PQGLB PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c360t-54997a7d4e06f2081b77c734ae34f1764d8b26c7d285fcf1a0e2a92b442b72423 |
| IEDL.DBID | U2A |
| ISSN | 1432-2994 |
| IngestDate | Sat Aug 23 14:42:49 EDT 2025 Tue Jul 01 04:11:17 EDT 2025 Fri Feb 21 02:43:29 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Stochastic matching Online algorithms Approximation algorithms Reusable resources |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c360t-54997a7d4e06f2081b77c734ae34f1764d8b26c7d285fcf1a0e2a92b442b72423 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-4890-1302 |
| PQID | 2854679103 |
| PQPubID | 32142 |
| PageCount | 14 |
| ParticipantIDs | proquest_journals_2854679103 crossref_primary_10_1007_s00186_023_00822_3 springer_journals_10_1007_s00186_023_00822_3 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2023-08-01 |
| PublicationDateYYYYMMDD | 2023-08-01 |
| PublicationDate_xml | – month: 08 year: 2023 text: 2023-08-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg – name: Heidelberg |
| PublicationTitle | Mathematical methods of operations research (Heidelberg, Germany) |
| PublicationTitleAbbrev | Math Meth Oper Res |
| PublicationYear | 2023 |
| Publisher | Springer Berlin Heidelberg Springer Nature B.V |
| Publisher_xml | – name: Springer Berlin Heidelberg – name: Springer Nature B.V |
| References | Yu, Jacobson, Kiyavash (CR32) 2019; 31 Su, Zenios (CR27) 2005; 53 Albright (CR2) 1976; 23 Woeginger (CR29) 1994; 130 Manshadi, Gharan, Saberi (CR20) 2012; 37 Albright (CR1) 1974; 21 CR19 CR16 Yu, Jacobson (CR31) 2018; 12 Grenadier, Weiss (CR11) 1997; 44 Fung, Poon, Zheng (CR10) 2008; 16 CR12 Terefe, Lee, Heo, Fox, Oh (CR28) 2016; 27 Gülpınar, Çanakoğlu, Branke (CR13) 2018; 266 Powell (CR24) 2007 Nikolaev, Jacobson (CR23) 2010; 58 Seiden (CR26) 1998; 22 Jacobson, Yu, Jokela (CR14) 2016; 88 Puterman (CR25) 2014 Fiat, Gorelik, Kaplan, Novgorodov, Bansal, Finocchi (CR9) 2015 Krengel, Sucheston (CR17) 1977; 83 CR3 Derman, Lieberman, Ross (CR4) 1972; 18 CR6 CR8 CR7 McLay, Jacobson, Nikolaev (CR21) 2009; 41 Nakai (CR22) 1986; 11 Lipton, Tomkins (CR18) 1994; 94 Disser, Fearnley, Gairing, Göbel, Klimm, Schmand, Skopalik, Tönnis (CR5) 2020; 45 Kennedy (CR15) 1986; 11 Wu, Ross (CR30) 2015; 62 RJ Lipton (822_CR18) 1994; 94 822_CR3 SR Grenadier (822_CR11) 1997; 44 MB Terefe (822_CR28) 2016; 27 G Yu (822_CR31) 2018; 12 AG Nikolaev (822_CR23) 2010; 58 GJ Woeginger (822_CR29) 1994; 130 ML Puterman (822_CR25) 2014 822_CR12 VH Manshadi (822_CR20) 2012; 37 T Nakai (822_CR22) 1986; 11 822_CR19 G Yu (822_CR32) 2019; 31 822_CR16 C Derman (822_CR4) 1972; 18 DT Wu (822_CR30) 2015; 62 U Krengel (822_CR17) 1977; 83 SH Jacobson (822_CR14) 2016; 88 SP Fung (822_CR10) 2008; 16 D Kennedy (822_CR15) 1986; 11 A Fiat (822_CR9) 2015 X Su (822_CR27) 2005; 53 WB Powell (822_CR24) 2007 LA McLay (822_CR21) 2009; 41 Y Disser (822_CR5) 2020; 45 SS Seiden (822_CR26) 1998; 22 S Albright (822_CR1) 1974; 21 N Gülpınar (822_CR13) 2018; 266 822_CR6 822_CR7 822_CR8 S Albright (822_CR2) 1976; 23 |
| References_xml | – volume: 41 start-page: 575 issue: 6 year: 2009 end-page: 591 ident: CR21 article-title: A sequential stochastic passenger screening problem for aviation security publication-title: IIE Trans doi: 10.1080/07408170802510416 – volume: 31 start-page: 577 issue: 6 year: 2019 end-page: 588 ident: CR32 article-title: A bi-criteria multiple-choice secretary problem publication-title: IISE Trans doi: 10.1080/24725854.2018.1516054 – year: 2014 ident: CR25 publication-title: Markov decision processes: discrete stochastic dynamic programming – volume: 44 start-page: 397 issue: 3 year: 1997 end-page: 416 ident: CR11 article-title: Investment in technological innovations: An option pricing approach publication-title: J Financ Econ doi: 10.1016/S0304-405X(97)00009-3 – ident: CR16 – ident: CR12 – volume: 58 start-page: 1023 year: 2010 end-page: 1027 ident: CR23 article-title: Technical Note-Stochastic Sequential Decision-Making with a Random Number of Jobs publication-title: Op Res doi: 10.1287/opre.1090.0778 – volume: 21 start-page: 60 issue: 1 year: 1974 end-page: 67 ident: CR1 article-title: Optimal sequential assignments with random arrival times publication-title: Manage Sci doi: 10.1287/mnsc.21.1.60 – year: 2007 ident: CR24 publication-title: Approximate Dynamic Programming: Solving the curses of dimensionality, doi: 10.1002/9780470182963 – ident: CR6 – volume: 88 start-page: 33 year: 2016 end-page: 38 ident: CR14 article-title: A double-risk monitoring and movement restriction policy for Ebola entry screening at airports in the United States publication-title: Prev Med doi: 10.1016/j.ypmed.2016.03.018 – volume: 53 start-page: 443 issue: 3 year: 2005 end-page: 455 ident: CR27 article-title: Patient choice in kidney allocation: a sequential stochastic assignment model publication-title: Oper Res doi: 10.1287/opre.1040.0180 – ident: CR8 – volume: 83 start-page: 745 issue: 4 year: 1977 end-page: 747 ident: CR17 article-title: Semiamarts and finite values publication-title: Bull Am Math Soc doi: 10.1090/S0002-9904-1977-14378-4 – volume: 62 start-page: 23 issue: 1 year: 2015 end-page: 31 ident: CR30 article-title: A stochastic assignment problem publication-title: Naval Res Logist (NRL) doi: 10.1002/nav.21611 – volume: 11 start-page: 230 issue: 2 year: 1986 end-page: 240 ident: CR22 article-title: A sequential stochastic assignment problem in a partially observable markov chain publication-title: Math Oper Res doi: 10.1287/moor.11.2.230 – ident: CR19 – start-page: 631 year: 2015 end-page: 642 ident: CR9 article-title: The temp secretary problem publication-title: Algorithms - ESA 2015 doi: 10.1007/978-3-662-48350-3_53 – volume: 16 start-page: 248 issue: 3 year: 2008 end-page: 262 ident: CR10 article-title: Online interval scheduling: randomized and multiprocessor cases publication-title: J Comb Optim doi: 10.1007/s10878-007-9131-z – volume: 37 start-page: 559 issue: 4 year: 2012 end-page: 573 ident: CR20 article-title: Online stochastic matching: Online actions based on offline statistics publication-title: Math Oper Res doi: 10.1287/moor.1120.0551 – ident: CR3 – volume: 94 start-page: 302 year: 1994 end-page: 311 ident: CR18 article-title: Online interval scheduling publication-title: SODA – volume: 12 start-page: 251 issue: 2 year: 2018 end-page: 263 ident: CR31 article-title: Online C-benevolent Job Scheduling on Multiple Machines publication-title: Optim Lett doi: 10.1007/s11590-017-1191-0 – volume: 18 start-page: 349 issue: 7 year: 1972 end-page: 355 ident: CR4 article-title: A sequential stochastic assignment problem publication-title: Manage Sci doi: 10.1287/mnsc.18.7.349 – volume: 11 start-page: 619 issue: 4 year: 1986 end-page: 626 ident: CR15 article-title: Optimal sequential assignment publication-title: Math Oper Res doi: 10.1287/moor.11.4.619 – volume: 22 start-page: 171 issue: 4 year: 1998 end-page: 177 ident: CR26 article-title: Randomized online interval scheduling publication-title: Oper Res Lett doi: 10.1016/S0167-6377(98)00019-4 – volume: 130 start-page: 5 issue: 1 year: 1994 end-page: 16 ident: CR29 article-title: On-line scheduling of jobs with fixed start and end times publication-title: Theoret Comput Sci doi: 10.1016/0304-3975(94)90150-3 – ident: CR7 – volume: 23 start-page: 151 issue: 1 year: 1976 end-page: 159 ident: CR2 article-title: A Markov chain version of the secretary problem publication-title: Naval Res Logist Q doi: 10.1002/nav.3800230114 – volume: 266 start-page: 291 issue: 1 year: 2018 end-page: 303 ident: CR13 article-title: Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2017.09.006 – volume: 45 start-page: 323 issue: 1 year: 2020 end-page: 352 ident: CR5 article-title: Hiring secretaries over time: The benefit of concurrent employment publication-title: Math Oper Res doi: 10.1287/moor.2019.0993 – volume: 27 start-page: 75 year: 2016 end-page: 89 ident: CR28 article-title: Energy-efficient multisite offloading policy using markov decision process for mobile cloud computing publication-title: Pervasive Mob Comput doi: 10.1016/j.pmcj.2015.10.008 – volume: 23 start-page: 151 issue: 1 year: 1976 ident: 822_CR2 publication-title: Naval Res Logist Q doi: 10.1002/nav.3800230114 – volume-title: Markov decision processes: discrete stochastic dynamic programming year: 2014 ident: 822_CR25 – volume: 31 start-page: 577 issue: 6 year: 2019 ident: 822_CR32 publication-title: IISE Trans doi: 10.1080/24725854.2018.1516054 – volume: 44 start-page: 397 issue: 3 year: 1997 ident: 822_CR11 publication-title: J Financ Econ doi: 10.1016/S0304-405X(97)00009-3 – volume: 11 start-page: 619 issue: 4 year: 1986 ident: 822_CR15 publication-title: Math Oper Res doi: 10.1287/moor.11.4.619 – volume: 58 start-page: 1023 year: 2010 ident: 822_CR23 publication-title: Op Res doi: 10.1287/opre.1090.0778 – volume: 41 start-page: 575 issue: 6 year: 2009 ident: 822_CR21 publication-title: IIE Trans doi: 10.1080/07408170802510416 – volume: 62 start-page: 23 issue: 1 year: 2015 ident: 822_CR30 publication-title: Naval Res Logist (NRL) doi: 10.1002/nav.21611 – ident: 822_CR8 doi: 10.1109/FOCS.2009.72 – volume: 18 start-page: 349 issue: 7 year: 1972 ident: 822_CR4 publication-title: Manage Sci doi: 10.1287/mnsc.18.7.349 – volume: 11 start-page: 230 issue: 2 year: 1986 ident: 822_CR22 publication-title: Math Oper Res doi: 10.1287/moor.11.2.230 – volume: 27 start-page: 75 year: 2016 ident: 822_CR28 publication-title: Pervasive Mob Comput doi: 10.1016/j.pmcj.2015.10.008 – ident: 822_CR19 doi: 10.1145/1993636.1993716 – start-page: 631 volume-title: Algorithms - ESA 2015 year: 2015 ident: 822_CR9 doi: 10.1007/978-3-662-48350-3_53 – volume: 22 start-page: 171 issue: 4 year: 1998 ident: 822_CR26 publication-title: Oper Res Lett doi: 10.1016/S0167-6377(98)00019-4 – ident: 822_CR3 – volume: 130 start-page: 5 issue: 1 year: 1994 ident: 822_CR29 publication-title: Theoret Comput Sci doi: 10.1016/0304-3975(94)90150-3 – volume: 12 start-page: 251 issue: 2 year: 2018 ident: 822_CR31 publication-title: Optim Lett doi: 10.1007/s11590-017-1191-0 – volume: 21 start-page: 60 issue: 1 year: 1974 ident: 822_CR1 publication-title: Manage Sci doi: 10.1287/mnsc.21.1.60 – volume: 266 start-page: 291 issue: 1 year: 2018 ident: 822_CR13 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2017.09.006 – volume: 83 start-page: 745 issue: 4 year: 1977 ident: 822_CR17 publication-title: Bull Am Math Soc doi: 10.1090/S0002-9904-1977-14378-4 – volume-title: Approximate Dynamic Programming: Solving the curses of dimensionality, year: 2007 ident: 822_CR24 doi: 10.1002/9780470182963 – volume: 94 start-page: 302 year: 1994 ident: 822_CR18 publication-title: SODA – ident: 822_CR12 doi: 10.1002/9781118625651 – volume: 88 start-page: 33 year: 2016 ident: 822_CR14 publication-title: Prev Med doi: 10.1016/j.ypmed.2016.03.018 – ident: 822_CR16 doi: 10.1007/978-3-642-40450-4_50 – volume: 53 start-page: 443 issue: 3 year: 2005 ident: 822_CR27 publication-title: Oper Res doi: 10.1287/opre.1040.0180 – volume: 45 start-page: 323 issue: 1 year: 2020 ident: 822_CR5 publication-title: Math Oper Res doi: 10.1287/moor.2019.0993 – ident: 822_CR6 – ident: 822_CR7 doi: 10.1145/3489048.3530960 – volume: 16 start-page: 248 issue: 3 year: 2008 ident: 822_CR10 publication-title: J Comb Optim doi: 10.1007/s10878-007-9131-z – volume: 37 start-page: 559 issue: 4 year: 2012 ident: 822_CR20 publication-title: Math Oper Res doi: 10.1287/moor.1120.0551 |
| SSID | ssj0001442 |
| Score | 2.3113234 |
| Snippet | We consider a class of stochastic online matching problems, where a set of sequentially arriving jobs are to be matched to a group of workers. The objective is... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 43 |
| SubjectTerms | Algorithms Approximation Business and Management Calculus of Variations and Optimal Control; Optimization Employment Expected values Markov analysis Matching Mathematical analysis Mathematics Mathematics and Statistics Operations research Operations Research/Decision Theory Original Article Passenger screening Queuing Random variables Scheduling Success Workers |
| SummonAdditionalLinks | – databaseName: ProQuest Central dbid: BENPR link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LS8QwEB50BdGDj1VxdZUcvGmw2yRNPMkqigg-EBe8leblCrrqtgv-fJM0dVXQW6El0C_JzJfJzDcAe4lmSspUYMNMhik3BgtiBJY9KRhLhWXW1w5fXWcXA3r5wB5iwK2MaZWNTQyGWr8qHyM_9JV-GXfOjRy_vWPfNcrfrsYWGrMw50ywcIevuZOz69u7L1vsjgvhvpOSFDvDS2PZTCie8_3ofAIuwUH2HJOfrmnKN39dkQbPc74CS5Eyon49x6swY0ZtmG8y1tuw3HRmQHGjtmHxm8zgGtz0vXD4x1NdpYiK50f3Y9XwpUSOsSLH_tSw8HLNqJbNQO67kGGJfJAWjc2k9PVV7qGO9JfrMDg_uz-9wLGRAlYkSyrsz4C84JqaJLOpIwGSc8UJLQyhtsczqoVMM8W1A9kq2ysSkxZHqXTgSe4J1wa0Rq8jswnIFqxQOuGac0mF1VJrB7ziTAklrGQd2G8wzN9qvYz8Sxk5IJ47xPOAeE460G1gzuPeKfPpTHfgoIF--vrv0bb-H20bFtIw2z57rwutajwxO45RVHI3LptPxSTIyA priority: 102 providerName: ProQuest |
| Title | Approximation algorithms for stochastic online matching with reusable resources |
| URI | https://link.springer.com/article/10.1007/s00186-023-00822-3 https://www.proquest.com/docview/2854679103 |
| Volume | 98 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JSwMxFH5YBdGDS1WsS8nBmwammWQSj1Vai-KCWNDTMNlsQVvptODPN8nM1AU9eJoMCTm8bN9L3vc9gKNIMyUlEdgwk2DKjcEiNgLLlhSMEWGZ9dzh65uk16eXj-yxJIXlVbR79SQZduo52c3nj_MBszEOMuU4rsES8767m8V90p7vv85FCG-cNCbYbba0pMr83sf34-gTY_54Fg2nTXcD1kqYiNrFuG7CghnVYbmKUq_DepWNAZWLsw6rX6QF3d_1XI8134LbtpcOfx8WPEWUvTyPJ8Pp4DVHDrMih__UIPOCzagQzkCuXYixRP6aFk3MLPcMK1co7vrzbeh3Ow_nPVymUsAqTqIp9l4gz7imJkoscTBAcq54TDMTU9viCdVCkkRxTQSzyrayyJDslEhnSsk95NqBxdF4ZHYB2YxlSkdccy6psFpq7c44xZkSSljJGnBcWTR9KxQz0rk2crB_6uyfBvuncQMOKqOn5erJU8_qTLgDMq76pBqIz-q_e9v7X_N9WCFhLvh4vgNYnE5m5tBhjKlsQk10L5qw1L54uuq471nn5u6-GSbaB3GTzNU |
| linkProvider | Springer Nature |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3JTuQwEC2xSCyHARrQNMPiA5zAIu0lNofRCA00zX4BiVuIN0CChiGNgJ_iG8d2EhqQ4MYtUqKK9FyuKruqXgEsJ4ZrpYjEltsUM2EtltRKrFpKck6k4y70Dh8epZ1TtnfGzwbgpe6FCWWVtU2Mhtrc6nBHvh46_VLhnRv9c_cPh6lRIbtaj9Ao1WLfPj_6I1vxe3fLr-8KIe3tk78dXE0VwJqmSQ-HA5HIhWE2SR3xHlEJoQVluaXMtUTKjFQk1cL4PzrtWnliSb5BFGNEiRB9eLmDMMwo3Qg7SrZ3Xi2_P5zE7CqjBHszz6omndiqF6bfhXJfiiPJOqbvHWE_uv2QkI1-rj0JP6oAFW2WGjUFA7bbgJG6Pr4BE_UcCFSZhQaMvyE1nIbjzUBT_nRV9kSi_PrCw9i7vCmQj4-RjzX1ZR7IoVFJ0oH8d7GeE4UrYXRvH4rQzeUfyrxCMQOn3wLwLAx1b7v2JyCX81ybRBghFJPOKGO8P9WCa6mlU7wJqzWG2V3JzpG98jBHxDOPeBYRz2gT5muYs2qnFllfr5qwVkPff_25tLmvpS3BaOfk8CA72D3a_wVjJK58qBuch6He_YNd8LFMTy1GBUJw_t0a-x-MmgL9 |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LTxRBEK7AkhA8-FgwrqL0QU_SYbYf0-3BGBQ2ILoQAwm3YfolJLisO0vUv-avs7pnhhUSuHGbZCY9ydfV9eiq-grgdeakNYZp6qXPqVDeU829pqZvtJRMBxli7_DXYb5zJD4fy-M5-Nv2wsSyylYnJkXtLmy8I9-InX65QuPGN0JTFnGwNfgw_knjBKmYaW3HadQisuf__MLwrXq_u4V7_Yaxwfbhpx3aTBiglufZlMbgSJXKCZ_lgaF1NEpZxUXpuQh9lQunDcutcvj3YEO_zDwr3zEjBDMqeiK47jwsKIyKsg4sfNweHny7sgMYqqRcq-CMotIXTctOatyLs_Bi8S-niXKd8utmcebr3kjPJqs3eAwPG3eVbNby9QTm_KgLi221fBcetVMhSKMkuvDgP4rDZdjfjKTlv8_qDklSnn9HIKenPyqC3jJBz9OelpEqmtSUHQS_S9WdJF4Qk4m_rGJvFz7UWYZqBY7uBeKn0BldjPwzIKGUpXWZckoZoYMzzqF1tUpabXUwsgdvWwyLcc3VUVyxMifEC0S8SIgXvAerLcxFc26rYiZlPVhvoZ-9vn2153evtgaLKK3Fl93h3gtYYmnjYxHhKnSmk0v_Eh2bqXnVSBCBk_sW2n8BVgiP |
| 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=Approximation+algorithms+for+stochastic+online+matching+with+reusable+resources&rft.jtitle=Mathematical+methods+of+operations+research+%28Heidelberg%2C+Germany%29&rft.au=Shanks%2C+Meghan&rft.au=Yu%2C+Ge&rft.au=Jacobson%2C+Sheldon+H.&rft.date=2023-08-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=1432-2994&rft.eissn=1432-5217&rft.volume=98&rft.issue=1&rft.spage=43&rft.epage=56&rft_id=info:doi/10.1007%2Fs00186-023-00822-3&rft.externalDocID=10_1007_s00186_023_00822_3 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-2994&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-2994&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-2994&client=summon |