Non-profit resource allocation and service scheduling with cross-subsidization and uncertain resource consumptions
•We formulate a chance-constrained model and three safe approximations for allocating for-profit and non-profit service in different resources.•We formulate an integrated resource allocation and service scheduling model for the above problem.•We conduct numerical studies on instances of for-profit a...
Uloženo v:
| Vydáno v: | Omega (Oxford) Ročník 99; s. 102191 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.03.2021
|
| Témata: | |
| ISSN: | 0305-0483, 1873-5274 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | •We formulate a chance-constrained model and three safe approximations for allocating for-profit and non-profit service in different resources.•We formulate an integrated resource allocation and service scheduling model for the above problem.•We conduct numerical studies on instances of for-profit and non-profit surgery planning to compare different models and approaches.•We analyze the impact of varying parameters and cross-subsidization on nonprofit operations.
We consider a mixture of for-profit and non-profit requests that share multiple resources at random consumption rates. The revenue from fulfilling for-profit requests is used to cross-subsidize the cost of non-profit operations, and we aim to maximize the number of completed non-profit service requests. We consider two problems that respectively optimize resource allocation and service schedules, and employ chance constraints to restrict the probability of undesired outcomes such as resource over-utilization and service delay. For the allocation model, we propose three approximations of the chance-constrained program, and derive their variants to allow variable resource capacities. For the scheduling model, we derive a mixed-integer linear programming reformulation and develop a two-phase algorithm that separately decides allocation decisions and the start time of each service request. We conduct numerical studies on randomly generated instances of non-profit surgery planning to demonstrate the computational results of different models, and the impact of varying parameters and cross-subsidization on non-profit operations. |
|---|---|
| AbstractList | •We formulate a chance-constrained model and three safe approximations for allocating for-profit and non-profit service in different resources.•We formulate an integrated resource allocation and service scheduling model for the above problem.•We conduct numerical studies on instances of for-profit and non-profit surgery planning to compare different models and approaches.•We analyze the impact of varying parameters and cross-subsidization on nonprofit operations.
We consider a mixture of for-profit and non-profit requests that share multiple resources at random consumption rates. The revenue from fulfilling for-profit requests is used to cross-subsidize the cost of non-profit operations, and we aim to maximize the number of completed non-profit service requests. We consider two problems that respectively optimize resource allocation and service schedules, and employ chance constraints to restrict the probability of undesired outcomes such as resource over-utilization and service delay. For the allocation model, we propose three approximations of the chance-constrained program, and derive their variants to allow variable resource capacities. For the scheduling model, we derive a mixed-integer linear programming reformulation and develop a two-phase algorithm that separately decides allocation decisions and the start time of each service request. We conduct numerical studies on randomly generated instances of non-profit surgery planning to demonstrate the computational results of different models, and the impact of varying parameters and cross-subsidization on non-profit operations. |
| ArticleNumber | 102191 |
| Author | Lu, Mengshi Shen, Siqian Zhao, Lin Nakao, Hideaki |
| Author_xml | – sequence: 1 givenname: Mengshi surname: Lu fullname: Lu, Mengshi email: mengshilu@purdue.edu organization: Krannert School of Management, Purdue University, West Lafayette, IN, USA – sequence: 2 givenname: Hideaki surname: Nakao fullname: Nakao, Hideaki email: nakaoh@umich.edu organization: Department of Industrial and Operations Engineering University of Michigan, Ann Arbor, MI, USA – sequence: 3 givenname: Siqian surname: Shen fullname: Shen, Siqian email: siqian@umich.edu organization: Department of Industrial and Operations Engineering University of Michigan, Ann Arbor, MI, USA – sequence: 4 givenname: Lin surname: Zhao fullname: Zhao, Lin email: zhaolin14@mails.tsinghua.edu.cn organization: Department of Industrial Engineering, Tsinghua University, Beijing, China |
| BookMark | eNqFkM1KAzEURoNUsK0-gZt5ganJJJOZWbiQ4h8U3eg6ZJKbNmWalCRT0ad32goFF7q6cPnO5btngkbOO0DomuAZwYTfrGd-A0s5KzBphk1BGnKGxqSuaF4WFRuhMaa4zDGr6QWaxLjGGJMa0zEKL97l2-CNTVmA6PugIJNd55VM1rtMOp1FCDs7rKNage4765bZh02rTAUfYx77Nlptv0753ikISVp3uqi8i_1mu4_ES3RuZBfh6mdO0fvD_dv8KV-8Pj7P7xa5opim3JRQMqC8VrVkmhVSVwyblnLgjFaKtm1BWcNbLsuaKmK4xGXVmMKUpOZSNXSKmuPdQ88ARiibDi1TkLYTBIu9PLEWB3liL08c5Q0s_cVug93I8PkPdXukYHhrZyGIqCwMNrQNoJLQ3v7JfwNA5o9o |
| CitedBy_id | crossref_primary_10_1111_poms_13940 crossref_primary_10_1016_j_ijpe_2023_108900 crossref_primary_10_1016_j_omega_2022_102779 crossref_primary_10_1016_j_omega_2023_102845 crossref_primary_10_3390_healthcare9060640 crossref_primary_10_1080_17509653_2024_2436658 crossref_primary_10_1080_15568318_2025_2501264 |
| Cites_doi | 10.1016/0360-8352(96)00047-2 10.1111/j.1937-5956.2007.tb00289.x 10.1137/17M1158707 10.1287/opre.2014.1314 10.1287/ijoc.1120.0530 10.1287/opre.1070.0441 10.1007/s10107-011-0494-7 10.1287/opre.40.1.113 10.1287/opre.51.4.543.16101 10.1016/S0927-0507(03)10005-9 10.1007/s10107-015-0929-7 10.1016/j.orl.2007.07.003 10.1016/S0378-4266(02)00271-6 10.1287/trsc.26.3.161 10.1016/j.ejor.2010.03.014 10.1287/opre.1090.0791 10.1097/00000542-200004000-00035 10.1007/s10107-016-0990-x 10.1287/ijoc.2018.0835 10.1137/130915315 10.1287/opre.1090.0712 10.1287/mnsc.40.10.1276 10.1137/S0097539797329142 10.1007/BF01584661 10.1287/opre.1080.0682 10.1016/S0377-2217(98)00113-1 10.1016/j.ejor.2009.04.011 10.1016/0167-6377(91)90083-2 10.21314/JOR.2000.038 10.1016/S0167-5060(08)70356-X 10.1016/S0360-8352(99)00136-9 10.1287/opre.1090.0741 10.1287/ijoc.2014.0595 10.1007/s10957-006-9084-x 10.1287/moor.1100.0445 10.1016/0377-2217(85)90284-X 10.1137/070702928 10.1287/ijoc.2013.0582 |
| ContentType | Journal Article |
| Copyright | 2019 |
| Copyright_xml | – notice: 2019 |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.omega.2019.102191 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Business |
| EISSN | 1873-5274 |
| ExternalDocumentID | 10_1016_j_omega_2019_102191 S0305048319306759 |
| GroupedDBID | --K --M -~X .~1 0R~ 13V 1B1 1OL 1RT 1~. 1~5 29N 4.4 457 4G. 5VS 7-5 71M 8P~ 96U 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABJNI ABKBG ABMAC ABMVD ABUCO ABXDB ABYKQ ACBMB ACDAQ ACGFS ACHQT ACHRH ACNCT ACNTT ACRLP ADBBV ADEZE ADIYS ADMUD AEBSH AEKER AENEX AFACB AFAZI AFFNX AFKWA AFTJW AGHFR AGJBL AGQRV AGUBO AGUMN AGYEJ AHEHV AHHHB AHMBA AIEXJ AIKHN AITUG AJBFU AJOXV ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ASPBG AVWKF AXJTR AZFZN BAAKF BDEBP BKOJK BKOMP BLXMC BNSAS CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA HAMUX HVGLF HZ~ IAO IEA IGG IHE IHR IOF IPO ITC J1W KOM LPU LXL LY1 M41 MO0 MS~ N95 O-L O9- OAUVE OHT OZT P-8 P-9 PC. PQQKQ Q38 R2- RIG ROL RPZ SDF SDG SDP SDS SES SEW SPCBC SSB SSD SSL SSZ T5K TAE TAF TN5 U5U VQA WUQ XI7 XPP XSW XYO YNT ZRQ ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADMHG ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS IPC ~HD |
| ID | FETCH-LOGICAL-c303t-f5e54e368c8a4d42ad740fb36e6437c3bb23496b6a583c1f6a0579f2f5186ac93 |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000591503800004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0483 |
| IngestDate | Tue Nov 18 21:59:17 EST 2025 Sat Nov 29 07:24:03 EST 2025 Fri Feb 23 02:45:57 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Allocation and scheduling Chance-constrained integer programming Non-profit operations research Safe approximations |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c303t-f5e54e368c8a4d42ad740fb36e6437c3bb23496b6a583c1f6a0579f2f5186ac93 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_omega_2019_102191 crossref_primary_10_1016_j_omega_2019_102191 elsevier_sciencedirect_doi_10_1016_j_omega_2019_102191 |
| PublicationCentury | 2000 |
| PublicationDate | March 2021 2021-03-00 |
| PublicationDateYYYYMMDD | 2021-03-01 |
| PublicationDate_xml | – month: 03 year: 2021 text: March 2021 |
| PublicationDecade | 2020 |
| PublicationTitle | Omega (Oxford) |
| PublicationYear | 2021 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Deng, Shen (bib0013) 2016; 157 Véricourt, deLobo (bib0011) 2009; 57 Scarf (bib0042) 1958; vol. 10 Cheng, Gen, Tsujimura (bib0010) 1999; 36 Chen, Sim, Sun (bib0007) 2007; 55 Cheng, Delage, Lisser (bib0008) 2014; 24 Laporte, Louveaux, Mercure (bib0029) 1992; 26 Feng, Shanthikumar (bib0020) 2017 Song, Luedtke, Küçükyavuz (bib0045) 2014; 26 Deng, Shen, Denton (bib0014) 2019; 31 Strum, May, Vargas (bib0046) 2000; 92 Zhang, Jiang, Shen (bib0052) 2018; 28 Feldstein (bib0019) 1971; 61 Luedtke, Ahmed (bib0031) 2008; 19 ElGhaoui, Oks, Oustry (bib0017) 2003; 51 Jain, Meeran (bib0025) 1999; 113 Long (bib0030) 1964 . Anheier (bib0001) 2014 Calafiore, El Ghaoui (bib0004) 2006; 130 Rockafellar, Uryasev (bib0041) 2002; 26 Oster (bib0034) 1995 Pinedo (bib0035) 2012 Queyranne M, Schulz AS. Polyhedral approaches to machine scheduling. 1996. Shapiro, Dentcheva, Ruszczyński (bib0043) 2009 Denton, Miller, Balasubramanian, Huschka (bib0015) 2010; 58 Min, Yih (bib0032) 2010; 206 Rockafellar, Uryasev (bib0040) 2000; 2 Graham, Lawler, Lenstra, Kan (bib0023) 1979; 5 Newhouse (bib0033) 1970; 60 Toth, Vigo (bib0048) 2014; 18 Shylo, Prokopyev, Schaefer (bib0044) 2012; 25 Wiesemann, Kuhn, Sim (bib0051) 2014; 62 Birge, Louveaux (bib0003) 1997 Chen, Sim, Sun, Teo (bib0006) 2010; 58 Zymler, Kuhn, Rustem (bib0054) 2013; 137 Qiu, Ahmed, Dey, Wolsey (bib0038) 2014; 26 Prékopa (bib0036) 1973; 4 Gendreau, Hertz, Laporte (bib0021) 1994; 40 Kulkarni, Bhave (bib0028) 1985; 20 Prékopa (bib0037) 2003; vol. 10 Erdogan, Denton (bib0018) 2011 Cardoen, Demeulemeester, Beliën (bib0005) 2010; 201 Cheng, Gen, Tsujimura (bib0009) 1996; 30 Bertsimas, Doan, Natarajan, Teo (bib0002) 2010; 35 Gupta (bib0024) 2007; 16 Strum, Sampson, May, Vargas (bib0047) 2000; 92 Van Laarhoven, Aarts, Lenstra (bib0049) 1992; 40 Wagner (bib0050) 2008; 36 Desrochers, Laporte (bib0016) 1991; 10 Jiang, Guan (bib0026) 2016; 158 Golden, Raghavan, Wasil (bib0022) 2008 Delage, Ye (bib0012) 2010; 58 Zhang Z, Denton B, Xie X. Branch and price for chance constrained bin packing. available at optimization-online. 2015. Kleinberg, Rabani, Tardos (bib0027) 2000; 30 Van Laarhoven (10.1016/j.omega.2019.102191_bib0049) 1992; 40 Rockafellar (10.1016/j.omega.2019.102191_bib0041) 2002; 26 Deng (10.1016/j.omega.2019.102191_bib0014) 2019; 31 Véricourt (10.1016/j.omega.2019.102191_bib0011) 2009; 57 Luedtke (10.1016/j.omega.2019.102191_bib0031) 2008; 19 Oster (10.1016/j.omega.2019.102191_bib0034) 1995 Gendreau (10.1016/j.omega.2019.102191_bib0021) 1994; 40 Denton (10.1016/j.omega.2019.102191_bib0015) 2010; 58 Wagner (10.1016/j.omega.2019.102191_bib0050) 2008; 36 Cheng (10.1016/j.omega.2019.102191_bib0009) 1996; 30 Pinedo (10.1016/j.omega.2019.102191_bib0035) 2012 Prékopa (10.1016/j.omega.2019.102191_bib0036) 1973; 4 Long (10.1016/j.omega.2019.102191_sbref0030) 1964 Bertsimas (10.1016/j.omega.2019.102191_bib0002) 2010; 35 Cheng (10.1016/j.omega.2019.102191_bib0010) 1999; 36 Newhouse (10.1016/j.omega.2019.102191_bib0033) 1970; 60 Delage (10.1016/j.omega.2019.102191_bib0012) 2010; 58 Chen (10.1016/j.omega.2019.102191_bib0007) 2007; 55 Anheier (10.1016/j.omega.2019.102191_bib0001) 2014 Cheng (10.1016/j.omega.2019.102191_bib0008) 2014; 24 10.1016/j.omega.2019.102191_bib0053 Erdogan (10.1016/j.omega.2019.102191_bib0018) 2011 Jain (10.1016/j.omega.2019.102191_bib0025) 1999; 113 Jiang (10.1016/j.omega.2019.102191_bib0026) 2016; 158 Scarf (10.1016/j.omega.2019.102191_sbref0041) 1958; vol. 10 Zhang (10.1016/j.omega.2019.102191_bib0052) 2018; 28 Graham (10.1016/j.omega.2019.102191_sbref0023) 1979; 5 Wiesemann (10.1016/j.omega.2019.102191_bib0051) 2014; 62 Feng (10.1016/j.omega.2019.102191_sbref0020) 2017 Kleinberg (10.1016/j.omega.2019.102191_bib0027) 2000; 30 Qiu (10.1016/j.omega.2019.102191_bib0038) 2014; 26 Cardoen (10.1016/j.omega.2019.102191_bib0005) 2010; 201 Song (10.1016/j.omega.2019.102191_bib0045) 2014; 26 Kulkarni (10.1016/j.omega.2019.102191_bib0028) 1985; 20 Strum (10.1016/j.omega.2019.102191_bib0047) 2000; 92 Deng (10.1016/j.omega.2019.102191_bib0013) 2016; 157 Shylo (10.1016/j.omega.2019.102191_bib0044) 2012; 25 Calafiore (10.1016/j.omega.2019.102191_bib0004) 2006; 130 Chen (10.1016/j.omega.2019.102191_bib0006) 2010; 58 Gupta (10.1016/j.omega.2019.102191_bib0024) 2007; 16 Rockafellar (10.1016/j.omega.2019.102191_bib0040) 2000; 2 Shapiro (10.1016/j.omega.2019.102191_sbref0042) 2009 Toth (10.1016/j.omega.2019.102191_bib0048) 2014; 18 Prékopa (10.1016/j.omega.2019.102191_sbref0037) 2003; vol. 10 Laporte (10.1016/j.omega.2019.102191_bib0029) 1992; 26 10.1016/j.omega.2019.102191_bib0039 Strum (10.1016/j.omega.2019.102191_bib0046) 2000; 92 Feldstein (10.1016/j.omega.2019.102191_bib0019) 1971; 61 Desrochers (10.1016/j.omega.2019.102191_bib0016) 1991; 10 Min (10.1016/j.omega.2019.102191_bib0032) 2010; 206 Zymler (10.1016/j.omega.2019.102191_bib0054) 2013; 137 ElGhaoui (10.1016/j.omega.2019.102191_bib0017) 2003; 51 Birge (10.1016/j.omega.2019.102191_bib0003) 1997 Golden (10.1016/j.omega.2019.102191_sbref0022) 2008 |
| References_xml | – volume: 57 start-page: 1114 year: 2009 end-page: 1128 ident: bib0011 article-title: Resource and revenue management in nonprofit operations publication-title: Oper Res – volume: 51 start-page: 543 year: 2003 end-page: 556 ident: bib0017 article-title: Worst-case value-at-risk and robust portfolio optimization: a conic programming approach publication-title: Oper Res – volume: 4 start-page: 202 year: 1973 end-page: 221 ident: bib0036 article-title: Contributions to the theory of stochastic programming publication-title: Math Program – year: 2011 ident: bib0018 article-title: Surgery planning and scheduling in publication-title: Wiley Encyclopedia of Oper Res and Management Science – year: 2017 ident: bib0020 article-title: Not-for-profit operations management. in publication-title: The Routledge Companion to Production and Operations Management – volume: 28 start-page: 2922 year: 2018 end-page: 2944 ident: bib0052 article-title: Ambiguous chance-constrained binary programs under mean-covariance information publication-title: SIAM J Optim – volume: 19 start-page: 674 year: 2008 end-page: 699 ident: bib0031 article-title: A sample approximation approach for optimization with probabilistic constraints publication-title: SIAM J Optim – volume: 130 start-page: 1 year: 2006 end-page: 22 ident: bib0004 article-title: On distributionally robust chance-constrained linear programs publication-title: J Optim Theory Appl – volume: 137 start-page: 167 year: 2013 end-page: 198 ident: bib0054 article-title: Distributionally robust joint chance constraints with second-order moment information publication-title: Math Program – volume: 61 start-page: 853 year: 1971 end-page: 872 ident: bib0019 article-title: Hospital cost inflation: a study of nonprofit price dynamics publication-title: Am Econ Rev – year: 2008 ident: bib0022 article-title: The Vehicle routing problem: latest advances and new challenges – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: bib0023 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann Discr Math – volume: 20 start-page: 58 year: 1985 end-page: 67 ident: bib0028 article-title: Integer programming formulations of vehicle routing problems publication-title: Eur J Oper Res – volume: 18 year: 2014 ident: bib0048 article-title: Vehicle routing: problems, methods, and applications – volume: 40 start-page: 113 year: 1992 end-page: 125 ident: bib0049 article-title: Job shop scheduling by simulated annealing publication-title: Oper Res – volume: 36 start-page: 343 year: 1999 end-page: 364 ident: bib0010 article-title: A tutorial survey of job-shop scheduling problems using genetic algorithms,part ii: hybrid genetic search strategies publication-title: Comput Ind Eng – volume: 10 start-page: 27 year: 1991 end-page: 36 ident: bib0016 article-title: Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints publication-title: Oper Res Lett – year: 1964 ident: bib0030 article-title: Efficient use of hospitals publication-title: The economics of health and medical care – volume: vol. 10 start-page: 267 year: 2003 end-page: 351 ident: bib0037 article-title: Probabilistic programming. in publication-title: Handbooks on Operations Research and Management Science – volume: 60 start-page: 64 year: 1970 end-page: 74 ident: bib0033 article-title: Toward a theory of nonprofit institutions: an economic model of a hospital publication-title: Am Econ Rev – volume: 2 start-page: 21 year: 2000 end-page: 42 ident: bib0040 article-title: Optimization of conditional value-at-risk publication-title: J Risk – volume: 30 start-page: 983 year: 1996 end-page: 997 ident: bib0009 article-title: A tutorial survey of job-shop scheduling problems using genetic algorithms—i. representation publication-title: Comput Ind Eng – volume: 206 start-page: 642 year: 2010 end-page: 652 ident: bib0032 article-title: Scheduling elective surgery under uncertainty and downstream capacity constraints publication-title: Eur J Oper Res – volume: 113 start-page: 390 year: 1999 end-page: 434 ident: bib0025 article-title: Deterministic job-shop scheduling: past, present and future publication-title: Eur J Oper Res – year: 1997 ident: bib0003 article-title: Introduction to stochastic programming – reference: Zhang Z, Denton B, Xie X. Branch and price for chance constrained bin packing. available at optimization-online. 2015. – volume: 30 start-page: 191 year: 2000 end-page: 217 ident: bib0027 article-title: Allocating bandwidth for bursty connections publication-title: SIAM J Comput – volume: 26 start-page: 735 year: 2014 end-page: 747 ident: bib0045 article-title: Chance-constrained binary packing problems publication-title: INFORMS J Comput – volume: 92 start-page: 1454 year: 2000 end-page: 1466 ident: bib0047 article-title: Surgeon and type of anesthesia predict variability in surgical procedure times publication-title: Anesthesiol J Am Soc Anesthesiol – volume: 16 start-page: 689 year: 2007 end-page: 700 ident: bib0024 article-title: Surgical suites’ operations management publication-title: Prod Oper Manag – volume: 26 start-page: 531 year: 2014 end-page: 546 ident: bib0038 article-title: Covering linear programming with violations publication-title: INFORMS J Comput – year: 2014 ident: bib0001 article-title: Nonprofit organizations: an introduction: theory, management, policy – volume: 31 start-page: 411 year: 2019 end-page: 632 ident: bib0014 article-title: Chance-constrained surgery planning under conditions of limited and ambiguous data publication-title: INFORMS J Comput – volume: vol. 10 year: 1958 ident: bib0042 article-title: A min-max solution of an inventory problem publication-title: Studies in the Mathematical Theory of Inventory and Production – volume: 58 start-page: 802 year: 2010 end-page: 816 ident: bib0015 article-title: Optimal allocation of surgery blocks to operating rooms under uncertainty publication-title: Oper Res – volume: 25 start-page: 682 year: 2012 end-page: 692 ident: bib0044 article-title: Stochastic operating room scheduling for high-volume specialties under block booking publication-title: INFORMS J Comput – year: 2012 ident: bib0035 article-title: Scheduling: theory, algorithms, and systems – volume: 58 start-page: 595 year: 2010 end-page: 612 ident: bib0012 article-title: Distributionally robust optimization under moment uncertainty with application to data-driven problems publication-title: Oper Res – volume: 40 start-page: 1276 year: 1994 end-page: 1290 ident: bib0021 article-title: A tabu search heuristic for the vehicle routing problem publication-title: Manag Sci – volume: 92 start-page: 1160 year: 2000 end-page: 1167 ident: bib0046 article-title: Modeling the uncertainty of surgical procedure times: comparison of log-normal and normal models publication-title: Anesthesiology – volume: 201 start-page: 921 year: 2010 end-page: 932 ident: bib0005 article-title: Operating room planning and scheduling: aliterature review publication-title: Eur J Oper Res – volume: 26 start-page: 1443 year: 2002 end-page: 1471 ident: bib0041 article-title: Conditional value-at-risk for general loss distributions publication-title: J Bank Financ – year: 2009 ident: bib0043 article-title: Lectures on stochastic programming: modeling and theory – year: 1995 ident: bib0034 article-title: Strategic management for nonprofit organizations: theory and cases – volume: 158 start-page: 291 year: 2016 end-page: 327 ident: bib0026 article-title: Data-driven chance constrained stochastic program publication-title: Math Program Ser A – volume: 24 start-page: 1485 year: 2014 end-page: 1506 ident: bib0008 article-title: Distributionally robust stochastic knapsack problem publication-title: SIAM J Optim – volume: 55 start-page: 1058 year: 2007 end-page: 1071 ident: bib0007 article-title: A robust optimization perspective on stochastic programming publication-title: Oper Res – volume: 58 start-page: 470 year: 2010 end-page: 485 ident: bib0006 article-title: From CVar to uncertainty set: implications in joint chance constrained optimization publication-title: Oper Res – volume: 36 start-page: 150 year: 2008 end-page: 156 ident: bib0050 article-title: Stochastic 0–1 linear programming under limited distributional information publication-title: Oper Res Lett – volume: 26 start-page: 161 year: 1992 end-page: 170 ident: bib0029 article-title: The vehicle routing problem with stochastic travel times publication-title: Transp Sci – reference: Queyranne M, Schulz AS. Polyhedral approaches to machine scheduling. 1996. – reference: . – volume: 62 start-page: 1358 year: 2014 end-page: 1376 ident: bib0051 article-title: Distributionally robust convex optimization publication-title: Oper Res – volume: 35 start-page: 580 year: 2010 end-page: 602 ident: bib0002 article-title: Models for minimax stochastic linear optimization problems with risk aversion publication-title: Math Oper Res – volume: 157 start-page: 245 year: 2016 end-page: 276 ident: bib0013 article-title: Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints publication-title: Math Program – ident: 10.1016/j.omega.2019.102191_bib0039 – volume: 30 start-page: 983 issue: 4 year: 1996 ident: 10.1016/j.omega.2019.102191_bib0009 article-title: A tutorial survey of job-shop scheduling problems using genetic algorithms—i. representation publication-title: Comput Ind Eng doi: 10.1016/0360-8352(96)00047-2 – volume: 16 start-page: 689 issue: 6 year: 2007 ident: 10.1016/j.omega.2019.102191_bib0024 article-title: Surgical suites’ operations management publication-title: Prod Oper Manag doi: 10.1111/j.1937-5956.2007.tb00289.x – volume: 28 start-page: 2922 issue: 4 year: 2018 ident: 10.1016/j.omega.2019.102191_bib0052 article-title: Ambiguous chance-constrained binary programs under mean-covariance information publication-title: SIAM J Optim doi: 10.1137/17M1158707 – volume: 62 start-page: 1358 issue: 6 year: 2014 ident: 10.1016/j.omega.2019.102191_bib0051 article-title: Distributionally robust convex optimization publication-title: Oper Res doi: 10.1287/opre.2014.1314 – volume: 25 start-page: 682 issue: 4 year: 2012 ident: 10.1016/j.omega.2019.102191_bib0044 article-title: Stochastic operating room scheduling for high-volume specialties under block booking publication-title: INFORMS J Comput doi: 10.1287/ijoc.1120.0530 – volume: 55 start-page: 1058 issue: 6 year: 2007 ident: 10.1016/j.omega.2019.102191_bib0007 article-title: A robust optimization perspective on stochastic programming publication-title: Oper Res doi: 10.1287/opre.1070.0441 – volume: 137 start-page: 167 issue: 1–2 year: 2013 ident: 10.1016/j.omega.2019.102191_bib0054 article-title: Distributionally robust joint chance constraints with second-order moment information publication-title: Math Program doi: 10.1007/s10107-011-0494-7 – year: 2008 ident: 10.1016/j.omega.2019.102191_sbref0022 – year: 2014 ident: 10.1016/j.omega.2019.102191_bib0001 – volume: 40 start-page: 113 issue: 1 year: 1992 ident: 10.1016/j.omega.2019.102191_bib0049 article-title: Job shop scheduling by simulated annealing publication-title: Oper Res doi: 10.1287/opre.40.1.113 – volume: 51 start-page: 543 issue: 4 year: 2003 ident: 10.1016/j.omega.2019.102191_bib0017 article-title: Worst-case value-at-risk and robust portfolio optimization: a conic programming approach publication-title: Oper Res doi: 10.1287/opre.51.4.543.16101 – year: 1964 ident: 10.1016/j.omega.2019.102191_sbref0030 article-title: Efficient use of hospitals – year: 1995 ident: 10.1016/j.omega.2019.102191_bib0034 – volume: vol. 10 start-page: 267 year: 2003 ident: 10.1016/j.omega.2019.102191_sbref0037 article-title: Probabilistic programming. in doi: 10.1016/S0927-0507(03)10005-9 – volume: 158 start-page: 291 issue: 1 year: 2016 ident: 10.1016/j.omega.2019.102191_bib0026 article-title: Data-driven chance constrained stochastic program publication-title: Math Program Ser A doi: 10.1007/s10107-015-0929-7 – year: 2012 ident: 10.1016/j.omega.2019.102191_bib0035 – volume: 36 start-page: 150 issue: 2 year: 2008 ident: 10.1016/j.omega.2019.102191_bib0050 article-title: Stochastic 0–1 linear programming under limited distributional information publication-title: Oper Res Lett doi: 10.1016/j.orl.2007.07.003 – volume: 26 start-page: 1443 issue: 7 year: 2002 ident: 10.1016/j.omega.2019.102191_bib0041 article-title: Conditional value-at-risk for general loss distributions publication-title: J Bank Financ doi: 10.1016/S0378-4266(02)00271-6 – volume: 26 start-page: 161 issue: 3 year: 1992 ident: 10.1016/j.omega.2019.102191_bib0029 article-title: The vehicle routing problem with stochastic travel times publication-title: Transp Sci doi: 10.1287/trsc.26.3.161 – volume: 206 start-page: 642 issue: 3 year: 2010 ident: 10.1016/j.omega.2019.102191_bib0032 article-title: Scheduling elective surgery under uncertainty and downstream capacity constraints publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2010.03.014 – volume: 60 start-page: 64 issue: 1 year: 1970 ident: 10.1016/j.omega.2019.102191_bib0033 article-title: Toward a theory of nonprofit institutions: an economic model of a hospital publication-title: Am Econ Rev – volume: 58 start-page: 802 issue: 4 year: 2010 ident: 10.1016/j.omega.2019.102191_bib0015 article-title: Optimal allocation of surgery blocks to operating rooms under uncertainty publication-title: Oper Res doi: 10.1287/opre.1090.0791 – year: 2011 ident: 10.1016/j.omega.2019.102191_bib0018 article-title: Surgery planning and scheduling in – volume: 92 start-page: 1160 issue: 4 year: 2000 ident: 10.1016/j.omega.2019.102191_bib0046 article-title: Modeling the uncertainty of surgical procedure times: comparison of log-normal and normal models publication-title: Anesthesiology doi: 10.1097/00000542-200004000-00035 – volume: 157 start-page: 245 issue: 1 year: 2016 ident: 10.1016/j.omega.2019.102191_bib0013 article-title: Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints publication-title: Math Program doi: 10.1007/s10107-016-0990-x – year: 2017 ident: 10.1016/j.omega.2019.102191_sbref0020 article-title: Not-for-profit operations management. in – volume: 31 start-page: 411 issue: 3 year: 2019 ident: 10.1016/j.omega.2019.102191_bib0014 article-title: Chance-constrained surgery planning under conditions of limited and ambiguous data publication-title: INFORMS J Comput doi: 10.1287/ijoc.2018.0835 – volume: 24 start-page: 1485 issue: 3 year: 2014 ident: 10.1016/j.omega.2019.102191_bib0008 article-title: Distributionally robust stochastic knapsack problem publication-title: SIAM J Optim doi: 10.1137/130915315 – volume: 58 start-page: 470 issue: 2 year: 2010 ident: 10.1016/j.omega.2019.102191_bib0006 article-title: From CVar to uncertainty set: implications in joint chance constrained optimization publication-title: Oper Res doi: 10.1287/opre.1090.0712 – volume: 61 start-page: 853 issue: 5 year: 1971 ident: 10.1016/j.omega.2019.102191_bib0019 article-title: Hospital cost inflation: a study of nonprofit price dynamics publication-title: Am Econ Rev – volume: 40 start-page: 1276 issue: 10 year: 1994 ident: 10.1016/j.omega.2019.102191_bib0021 article-title: A tabu search heuristic for the vehicle routing problem publication-title: Manag Sci doi: 10.1287/mnsc.40.10.1276 – volume: 92 start-page: 1454 issue: 5 year: 2000 ident: 10.1016/j.omega.2019.102191_bib0047 article-title: Surgeon and type of anesthesia predict variability in surgical procedure times publication-title: Anesthesiol J Am Soc Anesthesiol – volume: 30 start-page: 191 issue: 1 year: 2000 ident: 10.1016/j.omega.2019.102191_bib0027 article-title: Allocating bandwidth for bursty connections publication-title: SIAM J Comput doi: 10.1137/S0097539797329142 – volume: 4 start-page: 202 issue: 1 year: 1973 ident: 10.1016/j.omega.2019.102191_bib0036 article-title: Contributions to the theory of stochastic programming publication-title: Math Program doi: 10.1007/BF01584661 – volume: 57 start-page: 1114 issue: 5 year: 2009 ident: 10.1016/j.omega.2019.102191_bib0011 article-title: Resource and revenue management in nonprofit operations publication-title: Oper Res doi: 10.1287/opre.1080.0682 – volume: 113 start-page: 390 issue: 2 year: 1999 ident: 10.1016/j.omega.2019.102191_bib0025 article-title: Deterministic job-shop scheduling: past, present and future publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(98)00113-1 – volume: 201 start-page: 921 issue: 3 year: 2010 ident: 10.1016/j.omega.2019.102191_bib0005 article-title: Operating room planning and scheduling: aliterature review publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2009.04.011 – volume: 10 start-page: 27 issue: 1 year: 1991 ident: 10.1016/j.omega.2019.102191_bib0016 article-title: Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints publication-title: Oper Res Lett doi: 10.1016/0167-6377(91)90083-2 – volume: vol. 10 year: 1958 ident: 10.1016/j.omega.2019.102191_sbref0041 article-title: A min-max solution of an inventory problem – ident: 10.1016/j.omega.2019.102191_bib0053 – volume: 2 start-page: 21 issue: 3 year: 2000 ident: 10.1016/j.omega.2019.102191_bib0040 article-title: Optimization of conditional value-at-risk publication-title: J Risk doi: 10.21314/JOR.2000.038 – volume: 18 year: 2014 ident: 10.1016/j.omega.2019.102191_bib0048 – year: 2009 ident: 10.1016/j.omega.2019.102191_sbref0042 – volume: 5 start-page: 287 year: 1979 ident: 10.1016/j.omega.2019.102191_sbref0023 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann Discr Math doi: 10.1016/S0167-5060(08)70356-X – volume: 36 start-page: 343 issue: 2 year: 1999 ident: 10.1016/j.omega.2019.102191_bib0010 article-title: A tutorial survey of job-shop scheduling problems using genetic algorithms,part ii: hybrid genetic search strategies publication-title: Comput Ind Eng doi: 10.1016/S0360-8352(99)00136-9 – volume: 58 start-page: 595 issue: 3 year: 2010 ident: 10.1016/j.omega.2019.102191_bib0012 article-title: Distributionally robust optimization under moment uncertainty with application to data-driven problems publication-title: Oper Res doi: 10.1287/opre.1090.0741 – volume: 26 start-page: 735 issue: 4 year: 2014 ident: 10.1016/j.omega.2019.102191_bib0045 article-title: Chance-constrained binary packing problems publication-title: INFORMS J Comput doi: 10.1287/ijoc.2014.0595 – volume: 130 start-page: 1 issue: 1 year: 2006 ident: 10.1016/j.omega.2019.102191_bib0004 article-title: On distributionally robust chance-constrained linear programs publication-title: J Optim Theory Appl doi: 10.1007/s10957-006-9084-x – year: 1997 ident: 10.1016/j.omega.2019.102191_bib0003 – volume: 35 start-page: 580 issue: 3 year: 2010 ident: 10.1016/j.omega.2019.102191_bib0002 article-title: Models for minimax stochastic linear optimization problems with risk aversion publication-title: Math Oper Res doi: 10.1287/moor.1100.0445 – volume: 20 start-page: 58 issue: 1 year: 1985 ident: 10.1016/j.omega.2019.102191_bib0028 article-title: Integer programming formulations of vehicle routing problems publication-title: Eur J Oper Res doi: 10.1016/0377-2217(85)90284-X – volume: 19 start-page: 674 issue: 2 year: 2008 ident: 10.1016/j.omega.2019.102191_bib0031 article-title: A sample approximation approach for optimization with probabilistic constraints publication-title: SIAM J Optim doi: 10.1137/070702928 – volume: 26 start-page: 531 issue: 3 year: 2014 ident: 10.1016/j.omega.2019.102191_bib0038 article-title: Covering linear programming with violations publication-title: INFORMS J Comput doi: 10.1287/ijoc.2013.0582 |
| SSID | ssj0001803 |
| Score | 2.3800237 |
| Snippet | •We formulate a chance-constrained model and three safe approximations for allocating for-profit and non-profit service in different resources.•We formulate an... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 102191 |
| SubjectTerms | Allocation and scheduling Chance-constrained integer programming Non-profit operations research Safe approximations |
| Title | Non-profit resource allocation and service scheduling with cross-subsidization and uncertain resource consumptions |
| URI | https://dx.doi.org/10.1016/j.omega.2019.102191 |
| Volume | 99 |
| WOSCitedRecordID | wos000591503800004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-5274 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001803 issn: 0305-0483 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9tAEF6lUFW9VPQlaAvaQ2_ByF6vX0dUUQFCoVJBinqx1utdMAQnTQLKvX-8s0-Hh6Jy6MWKrPXYznyenf12Hgh9rSTLOCAnSIuIBJTDl15JUgdZKHhNpHKxpW42kQ0G-XBY_Oj1_rhcmLtR1rb5YlFM_quq4RwoW6XOPkPdXiicgN-gdDiC2uH4T4ofjNtAd-Ke96eWm--r3XXDzenNgpkxEH1Y2cJMM_J8rJ4ygxnYkqa2-Zl6PMx9JnKgk8h16uako_usg3t6Iy6YrmG6MGHznmg4udXkq2gvZpeN56DZNdNk7WFTC3BmPeFjk0Z-Nr-X8Pvr0gw-seXCLVtBlsK1XJaWChakpnmNs8CmRZI1oarXuGng9ci6G6Lham-sXkWF5RV73ej7tbQfzHE-8tAFtV2VWkiphJRGyAu0TrKkAOu-vn90MDz2E3qUh6bLtn10V7xKhwk-epanHZwlp-VsA72xqw28b1DyFvVE-w69cskO79G0Awt2qsUdWDAoH1uw4A4sWIEFPwEWPd6DpZO4DJYP6Pz7wdm3w8B24Qg4uDfzQCYioSJOc54zWlPC6oyGsopTofZ8eVxVRDUdqFKW5DGPZMpUfrMkMonylPEi_ojW2nErNhFmCQmljAQskjOag2-cxoQXFQenmYaUJVuIuL-u5LZEveqUMipXqG0L7fqLJqZCy-rhqdNJaZ1M4zyWgLJVF3563n0-o9cd_r-gtfn0Vmyjl_xu3symOxZifwFQKKH2 |
| linkProvider | Elsevier |
| 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=Non-profit+resource+allocation+and+service+scheduling+with+cross-subsidization+and+uncertain+resource+consumptions&rft.jtitle=Omega+%28Oxford%29&rft.au=Lu%2C+Mengshi&rft.au=Nakao%2C+Hideaki&rft.au=Shen%2C+Siqian&rft.au=Zhao%2C+Lin&rft.date=2021-03-01&rft.issn=0305-0483&rft.volume=99&rft.spage=102191&rft_id=info:doi/10.1016%2Fj.omega.2019.102191&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_omega_2019_102191 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0483&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0483&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0483&client=summon |