Given two machines $A$ and $B$, with a collections of jobs in time intervals $(s,f)$ with '$s$' and '$f$' being start and finish times respectively.
Is there a way to schedule all jobs?
The problem must be formulated as an algorithmic problem and an algorithm solution must be presented.
I'm lost on how to conceptualize this problem, I've thought about setting up a bipartite graph with a set of nodes $X$ and $Y$, $X$ being the jobs, $Y$ being the machines or would setting $Y$ to be available time slots of the two machines be the better choice?