The project implements a dynamic programming approach to solve the Weighted Interval Scheduling problem, efficiently finding the optimal set of non-overlapping jobs with maximum profit from a given set of intervals.

A modern `setInterval` substitute tailored for asynchronous tasks, ensuring non-overlapping executions by skipping attempts if a previous execution is still in progress. Features graceful teardown (ideal for production apps demanding smooth resource cleanup), execution status getters, and a fixed delay between runs.