Assuming That the Customers Are Ranked in Proximity to One $\rightarrow$

Assuming that the customers are ranked in proximity to one another (ie., customer 4 is closer to customer 3 than customer 5 is) , use the concurrent scheduler approach to assign deliveries to vehicles such that no deliveries are late and driving distance is minimized. Assume that drive time to each customer is 15 minutes.

-Determine the delivery schedule of Vehicle 3.

A) 1 $\rightarrow$ 4 $\rightarrow$ 6 $\rightarrow$ 7 $\rightarrow$ 10 $\rightarrow$ 11
B) 2 $\rightarrow$ 3 $\rightarrow$ 9 $\rightarrow$ 12
C) 5 $\rightarrow$ 8
D) 2 $\rightarrow$ 3 $\rightarrow$ 6 $\rightarrow$ 12
E) 1 $\rightarrow$ 4 $\rightarrow$ 7 $\rightarrow$ 11