FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2980534764> ?p ?o ?g. }

• W2980534764 endingPage "16" @default.
• W2980534764 startingPage "1" @default.
• W2980534764 abstract "This article studies the optimal allocation of inpatient rooms for multiple types of patients in public hospitals and the patient scheduling problem with planned acceptance ratios (ARs). For public hospitals, it is important to allocate limited resources to multiple types of patients and manage patient access for maximizing hospital revenue and upholding service equity. The problem is formulated as two-stage models. Considering uncertainties in patients' arrival and length of stay, we first propose a nonlinear stochastic programming (NSP) model for inpatient room allocation with the objective of maximizing revenue under the constraints of maintaining equity. To solve this problem, we transform the complex NSP model into a deterministic mixed-integer linear programming model, which is solved by CPLEX, by reformulating the chance constraints as knapsack constraints based on a linearization technique and a simulation model. Given the allocated capacity and planned AR, we further propose a two-stage stochastic mixed-integer program combined with a goal program model to optimize patient scheduling. To solve the model, a Benders decomposition based on the sample average approximation approach is proposed. The real data-based experimental results demonstrate the applicability and effectiveness of our models and approaches. The impacts of some parameters on the objective and decisions are also explored. A simulation procedure is developed to compare the performances of different patient scheduling methods, from which the results show that our proposed approach outperforms a benchmark policy. Note to Practitioners-Inpatient rooms are critical resources for hospitals. Against the background of aging populations and environmental problems, the twofold predicament-involving escalating healthcare demands and insufficient room-based resources-has led to the necessity for hospitals to operate more effectively and efficiently. Capacity management and patient scheduling are thus the two most important operations for hospital management. Because of the self-financing feature of hospitals and the quasi-public nature of medical services, it is important for public hospitals to judiciously allocate limited room capacities to multiple types of patients for balancing revenue and equity and schedule the arrival demands dynamically according to the planned capacity and acceptance ratio. In this article, we propose mathematical models and solution approaches for these two-stage problems, and their applicability and effectiveness are demonstrated by experiments based on real data. The managerial insights suggest that hospitals should improve the service equity gradually according to their financial situation because of the increasing marginal cost and should apply the scientific approaches and techniques, rather than by their experiences, to aid their management for better performance. By using approaches proposed in this article, hospital managers can be equipped with a decision support tool for effective capacity allocation and patient scheduling decisions. The parameters of our models could be tuned based on the preferences of different hospitals. Furthermore, these approaches can be applied to other settings with similar problems, such as government budget allocation considering both utility and equity, and service system management with waiting time requirement." @default.
• W2980534764 created "2019-10-25" @default.
• W2980534764 creator A5011681810 @default.
• W2980534764 creator A5036881843 @default.
• W2980534764 creator A5056155405 @default.
• W2980534764 creator A5072380471 @default.
• W2980534764 date "2019-01-01" @default.
• W2980534764 modified "2023-10-18" @default.
• W2980534764 title "Public Hospital Inpatient Room Allocation and Patient Scheduling Considering Equity" @default.
• W2980534764 cites W1490010216 @default.
• W2980534764 cites W1514853693 @default.
• W2980534764 cites W1558516341 @default.
• W2980534764 cites W1569990960 @default.
• W2980534764 cites W1603821258 @default.
• W2980534764 cites W1959670890 @default.
• W2980534764 cites W1966632667 @default.
• W2980534764 cites W1977384739 @default.
• W2980534764 cites W1980790517 @default.
• W2980534764 cites W1983916623 @default.
• W2980534764 cites W1983993758 @default.
• W2980534764 cites W1986777111 @default.
• W2980534764 cites W1987471748 @default.
• W2980534764 cites W1993487035 @default.
• W2980534764 cites W1994426348 @default.
• W2980534764 cites W1995871788 @default.
• W2980534764 cites W2000888627 @default.
• W2980534764 cites W2003321477 @default.
• W2980534764 cites W2007261666 @default.
• W2980534764 cites W2014320990 @default.
• W2980534764 cites W2016660160 @default.
• W2980534764 cites W2018661294 @default.
• W2980534764 cites W2037188924 @default.
• W2980534764 cites W2039397350 @default.
• W2980534764 cites W2040379256 @default.
• W2980534764 cites W2045152979 @default.
• W2980534764 cites W2054039712 @default.
• W2980534764 cites W2055186906 @default.
• W2980534764 cites W2064133327 @default.
• W2980534764 cites W2066389237 @default.
• W2980534764 cites W2069189210 @default.
• W2980534764 cites W2070171601 @default.
• W2980534764 cites W2078259699 @default.
• W2980534764 cites W2078724364 @default.
• W2980534764 cites W2081035678 @default.
• W2980534764 cites W2099506495 @default.
• W2980534764 cites W2103094762 @default.
• W2980534764 cites W2104249385 @default.
• W2980534764 cites W2105887395 @default.
• W2980534764 cites W2117781171 @default.
• W2980534764 cites W2137531622 @default.
• W2980534764 cites W2138195917 @default.
• W2980534764 cites W2138546499 @default.
• W2980534764 cites W2139727821 @default.
• W2980534764 cites W2148199615 @default.
• W2980534764 cites W2156392948 @default.
• W2980534764 cites W2160644054 @default.
• W2980534764 cites W2166797227 @default.
• W2980534764 cites W2167585525 @default.
• W2980534764 cites W2179302967 @default.
• W2980534764 cites W2191190162 @default.
• W2980534764 cites W2307788505 @default.
• W2980534764 cites W2336411022 @default.
• W2980534764 cites W2406566176 @default.
• W2980534764 cites W2463039375 @default.
• W2980534764 cites W2472113677 @default.
• W2980534764 cites W2490217823 @default.
• W2980534764 cites W2579927066 @default.
• W2980534764 cites W2613093268 @default.
• W2980534764 cites W2739021589 @default.
• W2980534764 cites W2753257993 @default.
• W2980534764 cites W2768498952 @default.
• W2980534764 cites W2806805620 @default.
• W2980534764 cites W2890419533 @default.
• W2980534764 cites W2915454501 @default.
• W2980534764 cites W2938697689 @default.
• W2980534764 cites W48523452 @default.
• W2980534764 cites W604922540 @default.
• W2980534764 doi "https://doi.org/10.1109/tase.2019.2942990" @default.
• W2980534764 hasPublicationYear "2019" @default.
• W2980534764 type Work @default.
• W2980534764 sameAs 2980534764 @default.
• W2980534764 citedByCount "4" @default.
• W2980534764 countsByYear W29805347642021 @default.
• W2980534764 countsByYear W29805347642023 @default.
• W2980534764 crossrefType "journal-article" @default.
• W2980534764 hasAuthorship W2980534764A5011681810 @default.
• W2980534764 hasAuthorship W2980534764A5036881843 @default.
• W2980534764 hasAuthorship W2980534764A5056155405 @default.
• W2980534764 hasAuthorship W2980534764A5072380471 @default.
• W2980534764 hasConcept C10138342 @default.
• W2980534764 hasConcept C11210021 @default.
• W2980534764 hasConcept C113138325 @default.
• W2980534764 hasConcept C121332964 @default.
• W2980534764 hasConcept C126255220 @default.
• W2980534764 hasConcept C13280743 @default.
• W2980534764 hasConcept C137631369 @default.
• W2980534764 hasConcept C158622935 @default.
• W2980534764 hasConcept C162324750 @default.

• next