Academic
Dual Heuristics Scheduling
Research on the NP-hard personnel tour scheduling problem, pairing two heuristics — one for which staff to assign, one for when — so planners can tune priorities without recomputing the whole schedule.
PythonArtificial IntelligenceAlgorithm+2
