Central AsianResearch Index

CONSTRAINT-AWARE AND EXPLAINABLE TEMPORAL RESOURCE SCHEDULING FOR TEAM COLLABORATION: HARD-CONSTRAINT FILTERING, SOFT-SCORE RANKING, PROTOTYPE EVIDENCE, AND CONFLICT-DENSITY EVALUATION DESIGN

Team collaborative scheduling requires more than discovering empty calendar intervals. A practical scheduling system must transform tasks into executable time blocks, avoid conflicts with required members, respect deadlines and working-hour rules, consider workload balance, and explain why a candidate slot is recommended. This paper proposes and evaluates a constraint-aware and explainable temporal resource scheduling method based on the design and prototype evidence of a team collaborative scheduling system. The method generates candidate slots from a time window, duration and granularity, removes infeasible slots through hard constraints, and ranks feasible slots through soft-score components including member availability, deadline fit, priority and workload penalty. The revised article uses figures and evidence from the fourth and fifth chapters of the thesis: the constraint-aware scheduling flow, the prototype recommendation interface, the score decomposition of Top-N results, and the low-conflict evaluation results. The current dataset validates executability and explanation capability, but all baseline methods achieve the same feasibility metrics. Therefore, the paper emphasizes cautious interpretation and proposes a highconflict-density evaluation design for future validation.

Сведения

Опубликовано
2026 · Т. 635, № 942, С. 686-693
Язык
Английский
ISSN
1694-7851 · 1694-8505
Издатель
Kyrgyz State University named after I. Arabaev
Аффилиации
Kyrgyz State University named after I. Arabaev