{"id":"https://openalex.org/W4387123760","doi":"https://doi.org/10.1109/case56687.2023.10260652","title":"Approximate Linear Program for Multi-Type Inpatient Allocation Admission Scheduling Problem","display_name":"Approximate Linear Program for Multi-Type Inpatient Allocation Admission Scheduling Problem","publication_year":2023,"publication_date":"2023-08-26","ids":{"openalex":"https://openalex.org/W4387123760","doi":"https://doi.org/10.1109/case56687.2023.10260652"},"language":"en","primary_location":{"id":"doi:10.1109/case56687.2023.10260652","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case56687.2023.10260652","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 19th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081639343","display_name":"Xuran Gong","orcid":"https://orcid.org/0000-0001-8382-7633"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuran Gong","raw_affiliation_strings":["Shanghai Jiao Tong University,Department of Industrial Engineering &#x0026; Management,Shanghai,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University,Department of Industrial Engineering &#x0026; Management,Shanghai,China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047298877","display_name":"Jiajun Dai","orcid":"https://orcid.org/0000-0002-1492-5034"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiajun Dai","raw_affiliation_strings":["Sino-US Global Logistics Institute, Shanghai Jiao Tong University,Shanghai,China","Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sino-US Global Logistics Institute, Shanghai Jiao Tong University,Shanghai,China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072380471","display_name":"Na Geng","orcid":"https://orcid.org/0000-0001-5389-6072"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Na Geng","raw_affiliation_strings":["Sino-US Global Logistics Institute, Shanghai Jiao Tong University,Shanghai,China","Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sino-US Global Logistics Institute, Shanghai Jiao Tong University,Shanghai,China","institution_ids":["https://openalex.org/I183067930"]},{"raw_affiliation_string":"Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":3.3287,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.91041667,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11773","display_name":"Healthcare Operations and Scheduling Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3604","display_name":"Emergency Medical Services"},"field":{"id":"https://openalex.org/fields/36","display_name":"Health Professions"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T11773","display_name":"Healthcare Operations and Scheduling Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3604","display_name":"Emergency Medical Services"},"field":{"id":"https://openalex.org/fields/36","display_name":"Health Professions"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12174","display_name":"Hospital Admissions and Outcomes","score":0.9714000225067139,"subfield":{"id":"https://openalex.org/subfields/2711","display_name":"Emergency Medicine"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T10391","display_name":"Healthcare Policy and Management","score":0.9682000279426575,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.7436336874961853},{"id":"https://openalex.org/keywords/admission-control","display_name":"Admission control","score":0.702146053314209},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6900110244750977},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6838959455490112},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6724203824996948},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.616105854511261},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5918522477149963},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.5397743582725525},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.5278767347335815},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.43946895003318787},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4104897081851959},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18473416566848755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16729849576950073},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1033802330493927},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.1010068953037262}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.7436336874961853},{"id":"https://openalex.org/C2778234956","wikidata":"https://www.wikidata.org/wiki/Q4683813","display_name":"Admission control","level":3,"score":0.702146053314209},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6900110244750977},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6838959455490112},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6724203824996948},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.616105854511261},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5918522477149963},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.5397743582725525},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.5278767347335815},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.43946895003318787},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4104897081851959},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18473416566848755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16729849576950073},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1033802330493927},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.1010068953037262},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/case56687.2023.10260652","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case56687.2023.10260652","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 19th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G7594109741","display_name":null,"funder_award_id":"72031007,71972129,72201170","funder_id":"https://openalex.org/F4320320997","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo"}],"funders":[{"id":"https://openalex.org/F4320320997","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","ror":"https://ror.org/02ddkpn78"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2116984624","https://openalex.org/W2122291906","https://openalex.org/W2142728935","https://openalex.org/W2144743612","https://openalex.org/W2159617688","https://openalex.org/W2319969911","https://openalex.org/W2601832346","https://openalex.org/W2608402432","https://openalex.org/W2904502596","https://openalex.org/W2966615861","https://openalex.org/W2980534764","https://openalex.org/W3123517799","https://openalex.org/W4295645134"],"related_works":["https://openalex.org/W2152670157","https://openalex.org/W2386410636","https://openalex.org/W176737593","https://openalex.org/W2808418668","https://openalex.org/W2903299703","https://openalex.org/W2016648086","https://openalex.org/W3105579180","https://openalex.org/W2156021013","https://openalex.org/W4399157305","https://openalex.org/W4281791088"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"an":[3,83,98],"inpatient":[4,14],"allocation":[5],"admission":[6,27,147],"scheduling":[7],"problem":[8,135],"by":[9,91,108,131],"considering":[10],"the":[11,37,55,69,73,81,94,105,124,133,137,150,157],"sharing":[12],"of":[13,39,44,71,112,118,136,159],"beds":[15],"among":[16],"patients":[17],"from":[18],"different":[19],"medical":[20],"departments.":[21],"Hospital":[22],"managers":[23],"need":[24],"to":[25,32,57,68,77],"make":[26,146],"control":[28],"decision":[29,50,148],"each":[30],"day":[31],"minimize":[33,58],"operational":[34],"costs.":[35],"Considering":[36],"uncertainty":[38],"patients'":[40,59],"arrival":[41],"and":[42,64,102],"length":[43],"stay,":[45],"we":[46],"propose":[47],"a":[48,109,116],"Markov":[49],"process":[51],"(MDP)":[52],"model":[53,96],"with":[54,115,162],"objective":[56],"waiting":[60],"cost,":[61],"diversion":[62],"cost":[63],"overcapacity":[65],"cost.":[66],"Due":[67],"curse":[70],"dimensionality,":[72],"MDP":[74,95],"is":[75,89],"difficult":[76],"solve.":[78],"To":[79],"address":[80],"problem,":[82],"approximate":[84,125,138,151],"linear":[85,100,110,139],"programming":[86],"(ALP)":[87],"approach":[88],"developed":[90],"firstly":[92],"transforming":[93],"into":[97],"equivalent":[99],"program":[101,140],"then":[103],"approximating":[104],"value":[106,126,152],"function":[107,127],"combination":[111],"basis":[113],"functions":[114],"set":[117],"parameters.":[119],"The":[120],"optimal":[121],"parameters":[122],"in":[123],"can":[128,145],"be":[129],"obtained":[130],"solving":[132],"dual":[134],"using":[141,149],"column":[142],"generation.":[143],"Managers":[144],"function.":[153],"Numerical":[154],"experiments":[155],"show":[156],"effectiveness":[158],"ALP":[160],"compared":[161],"other":[163],"policies.":[164]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
