Dual-Fairness Nurse Scheduling via the Double Direct Progressive Filling Algorithm under Qualification and Contract Constraints

Tita Putri Redytadevi, Toni Bakhtiar, Jaharuddin Jaharuddin

Abstract


Nurse scheduling requires balancing workload distribution while satisfying qualification and employment contract constraints. This study implements a hybrid scheduling framework integrating Goal Programming (GP), the Double Direct Progressive Filling Algorithm (DDPFA), and the CP-SAT solver to generate feasible nurse schedules under actual and workforce-reduction scenarios in inpatient and emergency departments. Performance is evaluated using four indicators: inter-shift fairness, inter-nurse fairness, soft-constraint compliance, and computation time. The results show that the proposed approach achieves lower standard deviation values (0.15–0.42), satisfies all soft constraints, and generates feasible schedules in under 3 seconds. Compared with the evaluated manual scheduling and goal programming approaches, the framework produced more balanced workload allocation across shifts and nurses under the evaluated scenarios. These findings suggest that the proposed framework may provide a practical approach for fairness-oriented and cost aware workforce planning under the evaluated hospital conditions.

Keywords


DDPFA; Fairness; Hybrid Heuristic; Nurse Scheduling Problem; Optimization.

Full Text:

PDF

References


J. Badriyah, S. Alhila, M. Hafiizh, and L. Muzdalifah, “An Optimization Model For The Nurse Scheduling Problem Considering Workload Variance,” Jurnal Derivat, vol. 11, no. 3, pp. 229–236, 2024, doi: 10.31316/j.derivat.v11i3.6899.

E. K. Burke, P. De Causmaecker, G. Vanden Berghe, and H. Van Landeghem, “The State of the Art of Nurse Rostering,” Journal of Scheduling, vol. 7, no. 6, pp. 441–499, Nov. 2004, doi: 10.1023/B:JOSH.0000046076.75950.0b.

B. Maenhout and M. Vanhoucke, “An integrated nurse staffing and scheduling analysis for longer-term nursing staff allocation problems,” Omega (Westport)., vol. 41, no. 2, pp. 485–499, Apr. 2013, doi: 10.1016/j.omega.2012.01.002.

Y. Zhai, R. Li, and Z. Yan, “Research on Application of Meticulous Nursing Scheduling Management Based on Data-Driven Intelligent Optimization Technology,” Comput. Intell. Neurosci., vol. 2022, pp. 1–12, Sep. 2022, doi: 10.1155/2022/3293806.

M. Tamiz, D. Jones, and C. Romero, “Goal programming for decision making: An overview of the current state-of-the-art,” Eur. J. Oper. Res., vol. 111, no. 3, pp. 569–581, Dec. 1998, doi: 10.1016/S0377-2217(97)00317-2.

A. Yasmine, O. Yassine, Y. Farouk, and C. Hicham, “Workload balancing for the nurse scheduling problem: A real-world case study from a French hospital,” Socioecon. Plann. Sci., vol. 95, p. 102046, Oct. 2024, doi: 10.1016/j.seps.2024.102046.

A. Mystakidis, C. Koukaras, P. Koukaras, K. Kaparis, S. G. Stavrinides, and C. Tjortjis, “Optimizing Nurse Rostering: A Case Study Using Integer Programming to Enhance Operational Efficiency and Care Quality,” Healthcare, vol. 12, no. 24, p. 2545, Dec. 2024, doi: 10.3390/healthcare12242545.

H. G. Santos, T. A. M. Toffolo, R. A. M. Gomes, and S. Ribas, “Integer programming techniques for the nurse rostering problem,” Ann. Oper. Res., vol. 239, no. 1, pp. 225–251, Apr. 2016, doi: 10.1007/s10479-014-1594-6.

P. Smet, “Generating balanced workload allocations in hospitals,” Oper. Res. Health Care, vol. 38, p. 100390, Sep. 2023, doi: 10.1016/j.orhc.2023.100390.

A. A. Constantino, D. Landa-Silva, E. L. de Melo, C. F. X. de Mendonça, D. B. Rizzato, and W. Romão, “A heuristic algorithm based on multi-assignment procedures for nurse scheduling,” Ann. Oper. Res., vol. 218, no. 1, pp. 165–183, Apr. 2014, doi: 10.1007/s10479-013-1357-9.

Z. Long, X. Wen, M. Lan, and Y. Yang, “Nursing rescheduling problem with multiple rescheduling methods under uncertainty,” Complex & Intelligent Systems, vol. 8, no. 6, pp. 4557–4569, Dec. 2022, doi: 10.1007/s40747-021-00554-z.

D. Feng et al., “Data-driven hospital personnel scheduling optimization through patients prediction,” CCF Transactions on Pervasive Computing and Interaction, vol. 3, no. 1, pp. 40–56, Mar. 2021, doi: 10.1007/s42486-020-00052-0.

Y. Li Huang, “The Development of Patient Scheduling Groups for an Effective Appointment System,” Appl. Clin. Inform., vol. 7, no. 1, pp. 43–58, Jan. 2016, doi: 10.4338/ACI-2015-08-RA-0097.

L. R. Samosir and F. Ahyaningsih, “Application of the Goal Programming Method in Nurse Scheduling at RSUD Dr. Hadrianus Sinaga Pangururan,” Indonesian Journal of Advanced Research, vol. 2, no. 7, pp. 965–982, Jul. 2023, doi: 10.55927/ijar.v2i7.4898.

T. C. Wong, M. Xu, and K. S. Chin, “A two-stage heuristic approach for nurse scheduling problem: A case study in an emergency department,” Comput. Oper. Res., vol. 51, pp. 99–110, Nov. 2014, doi: 10.1016/j.cor.2014.05.018.

E. K. Burke, T. Curtois, G. Post, R. Qu, and B. Veltman, “A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem,” Eur. J. Oper. Res., vol. 188, no. 2, pp. 330–341, Jul. 2008, doi: 10.1016/j.ejor.2007.04.030.

Y. Fang, W. Hu, and L. Luo, “Chvátal–Gomory Cuts Applied to the Nurse Rostering Problem,” Systems, vol. 13, no. 9, p. 745, Aug. 2025, doi: 10.3390/systems13090745.

S. Senbel, “A Fairness-Based Heuristic Technique for Long-Term Nurse Scheduling,” Asia-Pacific Journal of Operational Research, vol. 38, no. 2, p. 2050047, Apr. 2021, doi: 10.1142/S0217595920500475.

S. J. M. den Hartog, H. Hoogeveen, and T. C. van der Zanden, “On the complexity of Nurse Rostering problems,” Operations Research Letters, vol. 51, no. 5, pp. 483–487, Sep. 2023, doi: 10.1016/j.orl.2023.07.004.

H. T. Le, M. Middendorf, and Y. Shi, “An Improvement Heuristic Based on Variable Neighborhood Search for Dynamic Orienteering Problems with Changing Node Values and Changing Budgets,” SN Comput. Sci., vol. 3, no. 4, p. 326, Jul. 2022, doi: 10.1007/s42979-022-01205-x.

C. M. Ngoo, S. L. Goh, S. N. Sze, N. R. Sabar, S. Abdullah, and G. Kendall, “A Survey of the Nurse Rostering Solution Methodologies: The State-of-the-Art and Emerging Trends,” IEEE Access, vol. 10, pp. 56504–56524, 2022, doi: 10.1109/ACCESS.2022.3177280.

S. Achmad, A. Wibowo, and D. Diana, “Ant colony optimization with semi random initialization for nurse rostering problem,” International Journal for Simulation and Multidisciplinary Design Optimization, vol. 12, p. 31, Nov. 2021, doi: 10.1051/smdo/2021030.

L. Zhu, Y. Zhou, S. Sun, and Q. Su, “Surgical cases assignment problem using an efficient genetic programming hyper-heuristic,” Comput. Ind. Eng., vol. 178, p. 109102, Apr. 2023, doi: 10.1016/j.cie.2023.109102.

S. Y. Jung, H.-E. Seo, S. H. Hong, and E.-Y. Doo, “Development of a nurse scheduling program using robotic process automation in Korea,” Health Informatics J., vol. 32, no. 1, pp. 1–16, Apr. 2026, doi: 10.1177/14604582251414581.

K. K. Klyve, H. Andersson, A. N. Gullhav, and B. H. Endreseth, “Semi-cyclic rostering of ranked surgeons — A real-life case with stability and flexibility measures,” Oper. Res. Health Care, vol. 28, p. 100286, Mar. 2021, doi: 10.1016/j.orhc.2021.100286.

H. Bin Obaid, “Double direct progressive filling algorithm to find the double MMF nurse schedule at a pediatric intensive care unit,” Journal of Engineering Research, vol. 13, no. 3, pp. 2572–2578, Sep. 2025, doi: 10.1016/j.jer.2024.05.015.

P. ’Namyar et al., “Solving Max-Min Fair Resource Allocations Quickly on Large Graphs,” 2023. doi: 10.48550/arXiv.2310.09699.

T. Harks, M. Hoefer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” IEEE/ACM Transactions on Networking, vol. 24, no. 4, pp. 2553–2562, Aug. 2016, doi: 10.1109/TNET.2015.2468571.

S. Kraul, M. Erhard, and J. O. Brunner, “Optimizing physician schedules with resilient break assignments,” Omega (Westport)., vol. 129, p. 103154, Dec. 2024, doi: 10.1016/j.omega.2024.103154.

S. Saemi, “Nurse scheduling problem by considering reserve nurses: a mathematical modeling and hybrid meta-heuristic algorithm,” Operational Research, vol. 25, no. 4, p. 103, Dec. 2025, doi: 10.1007/s12351-025-00981-7.

F. J. Renggli, M. Gerlach, J. S. Bieri, C. Golz, and M. Sariyar, “Integrating Nurse Preferences Into AI-Based Scheduling Systems: Qualitative Study,” JMIR Form. Res., vol. 9, p. e67747, Jun. 2025, doi: 10.2196/67747.

P. Cappanera, F. Visintin, and R. Rossi, “The emergency department physician rostering problem: obtaining equitable solutions via network optimization,” Flex. Serv. Manuf. J., vol. 34, no. 4, pp. 916–959, Dec. 2022, doi: 10.1007/s10696-021-09426-7.

A. Ghodsi, M. Zaharia, S. Shenker, and I. Stoica, “Choosy: Max-Min Fair Sharing for Datacenter Jobs with Constraints,” in Proceedings of the 8th ACM European Conference on Computer Systems, New York, NY, USA: ACM, Apr. 2013, pp. 365–378. doi: 10.1145/2465351.2465387.

L. Huang, Y. Gao, and F. Xiao, “Balancing Workload Fairness in Task Assignment: Modeling via Piecewise Linear Approximation,” Applied Sciences, vol. 16, no. 4, p. 1747, Feb. 2026, doi: 10.3390/app16041747.




DOI: http://dx.doi.org/10.30829/zero.v10i2.29388

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

 
 
✉  Contact & Indexing
Get in touch with ZERO: Jurnal Sains, Matematika dan Terapan
Email
zero_journal@uinsu.ac.id
WhatsApp · Admin Official
085270009767