Find the minimum number of platforms in a train station to avoid delays in the arrival of a train. In other words, given a list of train arrival and departure times, determine in principle what would...

Find the minimum number of platforms in a train station to avoid delays in the arrival of a train. In other words, given a list of train arrival and departure times, determine in principle what would be the number of operating platforms to avoid delays in the arrival of a train.

What would be the greedy strategy if we used a greedy algorithm to solve the problem?

To exemplify, use the following information:
Arrival = {2.00,2.10,3.00,3.20,3.50,5.00}
Output = {2.30,3.40,3.20,4.30,4.00,5.20}