1. Bi-objective approaches for home healthcare medical team planning and scheduling problem
- Author
-
Dapeng Yang, Ming Liu, Qiang Su, and Lujun Xu
- Subjects
Service (systems architecture) ,021103 operations research ,Operations research ,Job shop scheduling ,Computer science ,Heuristic (computer science) ,Applied Mathematics ,0211 other engineering and technologies ,Pareto principle ,02 engineering and technology ,Scheduling (computing) ,Computational Mathematics ,Patient satisfaction ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Constraint (mathematics) ,Integer (computer science) - Abstract
In this paper, we study the medical team planning and scheduling in home healthcare within a weekly horizon, including the planning of nursing visits and the daily traveling route scheduling. Two objectives are considered: the first one is to minimize the total operation cost of the healthcare agency and the second one is to maximize the patient satisfaction. The problem is formulated as a mixed integer program, to seek for a trade-off between two objectives, with the characteristics of the patient requirements including nursing types, nursing frequency and service length considered. Medical team types, available service days and overwork penalty are also respected in the model. Then an $$\epsilon $$ -constraint method is adopted to obtain exact non-dominated solutions. To address large-scale problem instances, three heuristic approaches are developed to generate approximate Pareto fronts in a reasonable time. The set of non-dominated solutions are valuable for decision-making. Computational experiments are conducted and the results demonstrate the efficiency of the approaches.
- Published
- 2018
- Full Text
- View/download PDF