Use a fibonacci heap to increase event list performance

[holgerbrandl]

Currently, we use a PriorityQueue with a remove-readd pattern on changes to schedule-time. Potentially this could be done more efficiently using a FibonacciHeap. See https://stackoverflow.com/questions/1871253/updating-java-priorityqueue-when-its-elements-change-priority