Application - Scheduling

You have $n$ tasks and $m$ time slots. Each task can be completed in certain time slots based on availability constraints. Schedule the maximum number of tasks such that each time slot handles at most one task. Model as bipartite matching: tasks are group $L$, time slots are group $R$.

An edge means task $i$ can use slot $j$. The maximum matching gives you the maximum number of tasks you can schedule without conflicts.