Assuming That the Customers Are Ranked in Proximity to One

Multiple Choice

Assuming that the customers are ranked in proximity to one another (ie., customer 5 is closer to customer 6 than customer 7 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 30 minutes.

-Determine the finish time for Vehicle 3.

A) 12:40 PM
B) 2:00 PM
C) 2:40 PM
D) 3:30 PM
E) 11:30 AM