Hospital-wide therapist scheduling and routing: Exact and heuristic methods
نویسندگان
چکیده
منابع مشابه
A sequential GRASP for the therapist routing and scheduling problem
This paper presents a new model and solution methodology for the problem faced by companies that provide rehabilitative services to clinic and home-bound patients. Given a set of multi-skilled therapists and a group of geographically dispersed patients, the objective is to construct weekly tours for the therapists that minimize the travel, treatment, and administrative costs while ensuring that...
متن کاملConstraint Analysis and Heuristic Scheduling Methods
Scheduling is one of the main problems that need to be solved by high-level hardware and software compilers. Existing heuristics are often incapable of finding feasible solutions for practical examples, because the tight time and resource constraints make the feasible-solution subspace very small compared to the size of the full search space. For that reason, constraint-analysis techniques that...
متن کاملHeuristic and exact algorithms for vehicle routing problems
The pickup and delivery problem with time windows is the problem of serving a number of transportationrequests using a limited amount of vehicles. Each request involves moving a number of goods from apickup location to a delivery location. Our task is to construct routes that visit all locations such thatcorresponding pickups and deliveries are placed on the same route and such that...
متن کاملHeuristic and Exact Algorithms for QoS Routing with Multiple Constraints ∗
The modern network service of finding the optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the multiconstrained optimal-path (MCOP) QoS routing problem, which is NP-complete. In this paper, this problem is solved through both exact and heuristic algorithms. We propose an exact algorithm E MCOP, which first constructs...
متن کاملHeuristic and exact algorithms for scheduling aircraft landings
The problem of scheduling aircraft landings on one or more runways is an interesting problem that is similar to a machine job scheduling problem with sequence-dependent processing times and with earliness and tardiness penalties. The aim is to optimally land a set of planes on one or several runways in such a way that separation criteria between all pairs of planes (not just successive ones) ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IISE Transactions on Healthcare Systems Engineering
سال: 2018
ISSN: 2472-5579,2472-5587
DOI: 10.1080/24725579.2018.1530314