Assignment and scheduling

Solves the assignment problem with the Hungarian method and picks the largest set of compatible intervals with the earliest-finish greedy algorithm.

Fill in the fields, run the tool and review the result. Your input is not added to a public page. Use the learning mode for calculation details.