In a hospital, the nursing assistants in wards are always responsible for delivering patients to do some medical examinations, and the nursing assistants in the medical departments need take these patients back to the corresponding wards after examinations. We transform this actual problem about nursing assistants’ daily work into a three-stage supply chain scheduling problem if patients are regarded as jobs, the ward as the customer, the nursing assistants as vehicles and the medical department as the processing machine in the factory. The capacity of each vehicle is limited because the nursing assistant only can deliver several patients once. And the transportation schedule back and forth between the customer and the factory are the same in view of the actual arrangement. In order to reduce the average consumption time of patients, the objective is to minimize the total flowtime, that is, the sum of arrival time of every completed job back to the customer. We show that the problem is NP-hard in the strong sense, and provide an approximation algorithm with the performance ratio of 2. Moreover, we study some polynomially solvable cases of the problem.
Three-stage supply chain scheduling problem Strongly NP-hard Approximation algorithm
This is a preview of subscription content, log in to check access.
This research is supported by National Natural Science Foundation of China “The research on supply chain scheduling problems with unavailability constraints” (No. 11601316). The first author is also supported by the key discipline “Applied Mathematics”of Shanghai Polytechnic University (No. XXKPY1604), Research Center of Resource Recycling Science and Engineering, and Gaoyuan Discipline of Shanghai – Environmental Science and Engineering (Resource Recycling Science and Engineering) of Shanghai Polytechnic University.
Besbes W, Teghem J, Loukil T (2016) Minimizing the maximum lead time in a 3-stage supply chain scheduling problem. META2016Google Scholar
Chen ZL (2010) Integrated production and outbound distribution scheduling: review and extensions. Oper Res 58:130–148CrossRefGoogle Scholar
Chen B, Li X (2018) Training and management for nursing assistants. J Pract Med Tech 25:921–922Google Scholar
Chen L, Zhang J, Fu W (2018) Health-promoting lifestyles and their related influences among nursing assistants in nursing homes in China. Appl Nurs Res 39:97–102CrossRefGoogle Scholar
Du G, Zheng LY, Ouyang XL (2019) Real-time scheduling optimization considering the unexpected events in home health care. J Comb Optim 37:196–220MathSciNetCrossRefGoogle Scholar
Fan J, Lu XW (2015) Supply chain scheduling problem in the hospital with periodic working time on a single machine. J Comb Optim 30:892–905MathSciNetCrossRefGoogle Scholar
Hu J-L, Zha C, Jiang Y-W (2012) Approximation algorithms for a three-stage supply chain scheduling problem. J Zhej Sci-Tech Uni 29:709–713Google Scholar
Kanaskie ML, Snyder C (2018) Nurses and nursing assistants decision-making regarding use of safe patient handling and mobility technology: a qualitative study. Appl Nurs Res 39:141–147CrossRefGoogle Scholar