{"title":"最佳养老院轮班安排:一种两阶段随机规划方法","authors":"Shujin Jiang, Mingyang Li, K. Hyer, N. Kong","doi":"10.1109/CASE48305.2020.9216967","DOIUrl":null,"url":null,"abstract":"In this paper, we study a nursing home staff schedule optimization problem under resident demand uncertainty. We formulate a two-stage stochastic binary program accordingly, with objective to minimize the total labor cost (linearly related to work time) incurred by both regular registered nurses (RRNs) and part-time nurses (PTNs). As a significant constraint, we balance RRNs’ total amount of work time with residents’ total service need for every considered shift. Besides, we restrict feasible shift schedules based on common scheduling practice. We conduct a series of computational experiments to validate the proposed model. We discuss our optimal solutions under different compositions of residents in terms of their disabilities. In addition, we compare the total labor costs and an RRN scheduling flexibility index with the given optimal solution under different combinations of RRNs and PTNs. Our analysis offers an operational approach to set the minimum number of nurses on flexible shift schedules to cover uncertain the service needs while maintaining a minimum labor cost.","PeriodicalId":212181,"journal":{"name":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal Nursing Home Shift Scheduling: A Two-Stage Stochastic Programming Approach\",\"authors\":\"Shujin Jiang, Mingyang Li, K. Hyer, N. Kong\",\"doi\":\"10.1109/CASE48305.2020.9216967\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study a nursing home staff schedule optimization problem under resident demand uncertainty. We formulate a two-stage stochastic binary program accordingly, with objective to minimize the total labor cost (linearly related to work time) incurred by both regular registered nurses (RRNs) and part-time nurses (PTNs). As a significant constraint, we balance RRNs’ total amount of work time with residents’ total service need for every considered shift. Besides, we restrict feasible shift schedules based on common scheduling practice. We conduct a series of computational experiments to validate the proposed model. We discuss our optimal solutions under different compositions of residents in terms of their disabilities. In addition, we compare the total labor costs and an RRN scheduling flexibility index with the given optimal solution under different combinations of RRNs and PTNs. Our analysis offers an operational approach to set the minimum number of nurses on flexible shift schedules to cover uncertain the service needs while maintaining a minimum labor cost.\",\"PeriodicalId\":212181,\"journal\":{\"name\":\"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CASE48305.2020.9216967\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASE48305.2020.9216967","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal Nursing Home Shift Scheduling: A Two-Stage Stochastic Programming Approach
In this paper, we study a nursing home staff schedule optimization problem under resident demand uncertainty. We formulate a two-stage stochastic binary program accordingly, with objective to minimize the total labor cost (linearly related to work time) incurred by both regular registered nurses (RRNs) and part-time nurses (PTNs). As a significant constraint, we balance RRNs’ total amount of work time with residents’ total service need for every considered shift. Besides, we restrict feasible shift schedules based on common scheduling practice. We conduct a series of computational experiments to validate the proposed model. We discuss our optimal solutions under different compositions of residents in terms of their disabilities. In addition, we compare the total labor costs and an RRN scheduling flexibility index with the given optimal solution under different combinations of RRNs and PTNs. Our analysis offers an operational approach to set the minimum number of nurses on flexible shift schedules to cover uncertain the service needs while maintaining a minimum labor cost.