The Tactical Fixed Interval Scheduling Problem (TFISP) is the problem of determining the minimum number of parallel nonidentical machines, such that a feasible schedule exists for a given set of jobs.

I'd like to contribute an implementation of the Weighted Interval Scheduling problem under the Dynamic Programming section of the repository. This is a classic optimization problem where each interval ...