{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T10:37:38Z","timestamp":1774003058362,"version":"3.50.1"},"reference-count":46,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:p>We propose a state-dependent \u201cdistributive decision rule\u201d for simultaneous capacity allocation and job assignment decisions in a multiperiod stochastic resource allocation context with random supply replenishment, random demand, job waiting and abandonment. Our decision rule can be reformulated into a convex optimization problem with polynomial number of constraints and decision variables. Our framework can be applied in many service management settings such as ride-sharing fleet repositioning and patient management in healthcare. In simulations, our framework records 1%\u201315% improvements over alternative paradigms such as fluid approximations and approximate dynamic programming.<\/jats:p>","DOI":"10.1287\/opre.2022.0255","type":"journal-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T10:14:59Z","timestamp":1751451299000},"page":"1047-1069","source":"Crossref","is-referenced-by-count":0,"title":["Joint Capacity Allocation and Job Assignment Under Uncertainty"],"prefix":"10.1287","volume":"74","author":[{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0001-5821-8844","authenticated-orcid":false,"given":"Peng","family":"Wang","sequence":"first","affiliation":[{"name":"School of Business, Singapore University of Social Sciences, Singapore 599494"}]},{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0001-5124-5161","authenticated-orcid":false,"given":"Yun Fong","family":"Lim","sequence":"additional","affiliation":[{"name":"Lee Kong Chian School of Business, Singapore Management University, Singapore 178899"}]},{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0003-1007-4575","authenticated-orcid":false,"given":"Gar Goei","family":"Loke","sequence":"additional","affiliation":[{"name":"Department of Management and Marketing, Durham University Business School, Durham DH1 1SL, United Kingdom"}]}],"member":"109","reference":[{"key":"B1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0777"},{"key":"B2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1367"},{"key":"B3","doi-asserted-by":"crossref","unstructured":"Bandi C, Loke GG, Wang P, Zhu T (2018) Prescriptive analytics for queue optimization: An optimization-based paradigm for modelling queues. Preprint, submitted June 20, https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.2139\/ssrn.3190874.","DOI":"10.2139\/ssrn.3190874"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0065"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2017.2952"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1080.0929"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2050"},{"key":"B8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0570"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-021-09725-8"},{"key":"B10","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2017.01.011"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1109\/9.471210"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1287\/msom.2018.0730"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5308"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2041"},{"key":"B15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0542"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1382"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2018.3145"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0621"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2183"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1462"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2021.0070"},{"key":"B22","doi-asserted-by":"crossref","unstructured":"Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Ortiz H, ed.\n                      Proc. 22nd Annual ACM Sympos. Theory Comput\n                      . (Association for Computing Machinery, New York), 352\u2013358.","DOI":"10.1145\/100216.100262"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1132"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2238"},{"key":"B25","doi-asserted-by":"crossref","unstructured":"Lyu G, Cheung WC, Teo CP, Wang H (2019) Multi-objective online ride-matching. Preprint, submitted April 17, https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.2139\/ssrn.3356823.","DOI":"10.2139\/ssrn.3356823"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1080\/0740817X.2011.564602"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1172-1"},{"key":"B28","doi-asserted-by":"publisher","DOI":"10.1137\/050622328"},{"key":"B29","doi-asserted-by":"publisher","DOI":"10.1287\/stsy.2019.0037"},{"key":"B30","doi-asserted-by":"publisher","DOI":"10.1016\/j.annemergmed.2011.03.004"},{"key":"B31","doi-asserted-by":"publisher","DOI":"10.1287\/educ.2019.0196"},{"key":"B32","doi-asserted-by":"publisher","DOI":"10.1287\/msom.2017.0683"},{"key":"B33","doi-asserted-by":"publisher","DOI":"10.1377\/hlthaff.2011.0786"},{"key":"B34","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.28.12.1441"},{"key":"B35","doi-asserted-by":"crossref","unstructured":"Riedel M (1999) Online matching for scheduling problems. Meinel C, Tison S, eds.\n                      STACS 99: Proc. 16th Sympos. Theoretical Aspects Comput. Sci.\n                      , Lecture Notes in Computer Science, vol. 1563 (Springer, Berlin, Heidelberg), 571\u2013580.","DOI":"10.1007\/3-540-49116-3_54"},{"key":"B36","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2013.1215"},{"key":"B37","doi-asserted-by":"publisher","DOI":"10.1111\/j.1553-2712.2011.01236.x"},{"key":"B38","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1030.0073"},{"key":"B39","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-022-09810-6"},{"key":"B40","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.09.002"},{"key":"B41","doi-asserted-by":"publisher","DOI":"10.1007\/s10696-016-9251-9"},{"key":"B42","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2021.2231"},{"key":"B43","doi-asserted-by":"publisher","DOI":"10.1111\/poms.12820"},{"key":"B44","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-012-9307-9"},{"key":"B45","doi-asserted-by":"publisher","DOI":"10.1287\/msom.2020.0959"},{"key":"B46","doi-asserted-by":"publisher","DOI":"10.1287\/msom.2023.1228"}],"container-title":["Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/pubsonline.informs.org\/doi\/pdf\/10.1287\/opre.2022.0255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T08:12:51Z","timestamp":1773994371000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/pubsonline.informs.org\/doi\/10.1287\/opre.2022.0255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10.1287\/opre.2022.0255"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1287\/opre.2022.0255","relation":{},"ISSN":["0030-364X","1526-5463"],"issn-type":[{"value":"0030-364X","type":"print"},{"value":"1526-5463","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}