The conference schedule is an NP problem since it is O(2**n). A greedy approach is pragmatic to solve the problem. We can pick various strategies to prepare a schedule such as the biggest talk first, smallest talk first, random selection, etc.
The Python code uses the Longest talk first and random selection to prepare schedules.
Written with StackEdit.