On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem