A listing of deliveries to be completed for the day are shown below. Assuming that the customers are ranked in proximity to one another (i.e., 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. Determine how many delivery vehicles are needed. Also, determine each vehicle€™s and driver€™s delivery schedule, with the start time and the finish time. Assume that drive time to each customer is 20 minutes.

Transcribed Image Text:

Estimated Promised Completion Delivery Arrival Time Vehicle Delivery Time 8:30 AM 9:00 AM 2 (1 is busy) 2 8:45 AM 9:30 AM 1 (2 is busy) 3 9:30 AM 10:15 AM 2 (1 is busy) 4 10:00 AM 10:30 AM 3 (1,2 are busy) 10:15 AM 11:15AM 4 (1,2,3 are busy) 10:30 AM 11:30 AM 2 (3,4 are busy) 11:00 AM 12:00 PM 1 (2,3,4 busy) 11:30 PM 1:00 PM 4 (1,2 busy) 12:00 PM 12:45 PM 2 (1,4 busy) 10 12:30 PM 1:30 PM 4 (2 is busy) 11 1:30 PM 2:15 PM 1 (2,4 busy) 12 1:45 PM 2:15 PM 2 (1,4 busy) 13 2:15 PM 3:30 PM 1(2 is busy) 14 3:00 PM 3:45 PM 4 (1,2 busy) 15 3:45 PM 4:15 PM 00