Several disciplines such as real-time artificial intelligence, operating systems, operations research, and local area networks have addressed problems of scheduling tasks with timing and precedence constraints. In this paper, we compare the different value-density algorithms, and suggest a novel algorithm that subsumes the previous ones with respect to schedulability. We assess the application of these various algorithms to the deliberation scheduling problem for autonomous agents.
/lp/association-for-computing-machinery/value-density-algorithms-for-the-deliberation-scheduling-problem-2txES8H0rA