A bi-objective genetic algorithm for intelligent rehabilitation scheduling considering therapy precedence constraints
- 484 Downloads
The rehabilitation inpatients in hospitals often complain about the service quality due to the long waiting time between the therapeutic processes. To enhance service quality, this study aims to propose an intelligent solution to reduce the waiting time through solving the rehabilitation scheduling problem. In particular, a bi-objective genetic algorithm is developed for rehabilitation scheduling via minimizing the total waiting time and the makespan. The conjunctive therapy concept is employed to preserve the partial precedence constraints between the therapies and thus the present rehabilitation scheduling problem can be formulated as an open shop scheduling problem, in which a special decoding algorithm is designed. We conducted an empirical study based on real data collected in a general hospital for validation. The proposed approach considered both the hospital operational efficiency and the patient centralized service needs. The results have shown that the waiting time of each inpatient can be reduced significantly and thus demonstrated the practical viability of the proposed bi-objective heuristic genetic algorithm.
KeywordsRehabilitation scheduling Service system Bi-objective Genetic algorithm Precedence constraints Hospital management
This research is supported by Ministry of Science and Technology, Taiwan (NSC 102-2221-E-007-057-MY3; MOST103-2218-E-007-023; MOST104-2911-I-007-502), National Natural Science Foundation of China (#71271068), and the Japan Society of Promotion of Science: Grant-in-Aid for Scientific Research under AQ1 Grant 24510219.0001.
- Costa, A., Cappadonna, F. A., & Fichera, S. (2015). A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent group scheduling problem. Journal of Intelligent Manufacturing. doi: 10.1007/s10845-015-1049-1.
- Falkenauer, E., & Bouffouix, S. (1991). A genetic algorithm for job shop. Proceedings of the 1991 IEEE international conference on robotics and automation (Vol. 1, pp. 824–829).Google Scholar
- Gen, M., & Cheng, R. (2000). Genetic algorithms and engineering optimization. New York: Wiley.Google Scholar
- Gen, M., Cheng, R., & Lin, L. (2008). Network models and optimization: Multiobjective genetic algorithm approach. London: Springer.Google Scholar
- Gen, M., Tsujimura, Y., & Kubota, E. (1994). Solving job-shop scheduling problems by genetic algorithm. IEEE International Conference on Systems, Man, and Cybernetics, & Humans, Information and Technology, 2, 1578–1582.Google Scholar
- Jamrus, T., Chien, C.-F., Gen, M., & Sethanan, K. (2015). Multistage production distribution under uncertain demands with integrated discrete particle swarm optimization and extended priority-based hybrid genetic algorithm. Fuzzy Optimization and Decision Making, 14(3), 265–287.CrossRefGoogle Scholar
- Liaw, C.-F. (2000). A hybrid genetic algorithm for the open shop scheduling problem. European Journal of Operation Research, 124, 28–42.Google Scholar
- Lu, P.-H., Wu, M.-C., Tan, H., Peng, Y.-H., & Chen, C.-F. (2015). A genetic algorithm embedded with a concise chromosome representation for distributed and flexible job-shop scheduling problems. Journal of Intelligent Manufacturing. doi: 10.1007/s10845-015-1083-z.
- Wu, J.-Z., Chien, C.-F., & Gen, M. (2012a). Coordinating strategic outsourcing decisions for semiconductor assembly using a bi-objective genetic algorithm. International Journal of Production Research, 50, 235–260.Google Scholar
- Zitzler, E., & Thiele, L. (2001). SPEA2: Improving the strength Pareto evolutionary algorithm. Technical report 103, Computer Engineering and Communication Networks Lab (TIK).Google Scholar