Patient admission planning using Approximate Dynamic Programming
نویسندگان
چکیده
منابع مشابه
Patient admission planning using Approximate Dynamic Programming
Tactical planning in hospitals involves elective patient admission planning and the allocation of hospital resource capacities. We propose a method to develop a tactical resource allocation and patient admission plan that takes stochastic elements into consideration, thereby providing robust plans. Our method is developed in an Approximate Dynamic Programming (ADP) framework and copes with mult...
متن کاملTactical Planning in Healthcare using Approximate Dynamic Programming
Tactical planning of resources in hospitals concerns elective patient admission planning and the intermediate term allocation of resource capacities. Its main objectives are to achieve equitable access for patients, to serve the strategically agreed number of patients, and to use resources efficiently. We propose a method to develop a tactical resource allocation and patient admission plan that...
متن کاملApproximate Disassembly Using Dynamic Programming
Most commercial anti-virus software uses signature based techniques to detect whether a file is infected by a virus or not. However, signature based detection systems are unable to detect metamorphic viruses, since such viruses change their internal structure from generation to generation. Previous work has shown that hidden Markov models (HMMs) can be used to detect metamorphic viruses. In thi...
متن کاملAdmission Control in UMTS Networks based on Approximate Dynamic Programming
This paper presents a Connection Admission Control (CAC) algorithm for Universal Mobile Telecommunications System (UMTS) networks based on an Approximate Dynamic Programming (ADP) approach. To deal with the non-stationary environment due to the timevarying statistical characteristics of the offered traffic, the admission policy has to be computed periodically based on on-line measurements. If s...
متن کاملApproximate Kinodynamic Planning Using &-Norm Dynamic Bounds
h this paper we address the issue of kinodynamic motion planning. Given a point that moves with bounded acceleration and velocity, we wish to find the time-optimal trajectory from a start state to a goal state (a state consists of both a position and a velocity). As finding exact optimal solutions to this problem seems very hard, we present a provably good approximation algorithm using the L2 n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Flexible Services and Manufacturing Journal
سال: 2015
ISSN: 1936-6582,1936-6590
DOI: 10.1007/s10696-015-9219-1