Asosiy kontentga oʻtish
Maqola

Learning Equitable and Efficient Shift Rosters with Multi-Objective Deep Reinforcement Learning and Counterfactual Fairness Constraints in Operations

Bui Thanh KhoaIndustrial University of Ho Chi Minh City, Vietnam;Kodirbek MakharovKimyo International University in Tashkent, Tashkent, Uzbekistan;Batirbek SamandarovMamun University, Khiva, Uzbekistan;Sanatbek JafarovUrgench State University, Urgench, Uzbekistan;Dilshod RaupovTashkent State Technical University, Tashkent, Uzbekistan; f University of Tashkent for Applied Sciences, Tashkent, Uzbekistan;Otabek DjurabaevTashkent State University of Economics, Tashkent, Uzbekistan
2026
ABI

Annotatsiya

Shift rostering systems often optimize cost and coverage while treating fairness as a secondary objective. This study develops a multi-objective deep reinforcement learning framework for workforce scheduling that integrates Proximal Policy Optimization with a graph neural network encoder, a Conditional Value-at-Risk term for limiting extreme burden concentration, and a counterfactual fairness regularizer for reducing demographic sensitivity in assignment decisions. The framework was evaluated on 18 months of workforce data from a tertiary hospital and an industrial facility in Uzbekistan. Relative to mixed-integer linear programming and vanilla reinforcement learning baselines, the proposed model reduced the burden Gini coefficient by 41.3%, narrowed weekend disparity by 36.5%, and achieved adverse impact ratios above 0.97 for gender and age. These equity gains were obtained with a 1.8% increase in operational cost and a 9.4% reduction in understaffing minutes under demand shocks. The results indicate that fairness constraints can be embedded directly into policy learning while preserving service levels and improving resilience in high-constraint scheduling environments.

Hali tarjima qilinmagan

Identifikatorlar

Iqtiboslar va manbalar

0 ta iqtibos0 ta foydalanilgan manba