Trucks arrive with EXPO(9.1) interarrival times (all times are in minutes) to an unload area that has three docks; the f rst truck arrives at time 0. The unload times are TRIA(25, 28, 30), TRIA(23, 26, 28), and TRIA(22, 25, 27) for docks 1, 2, and 3, respectively. If there is an empty dock, the truck proceeds immediately to that dock. Assume zero travel times to all docks. If there is more than one empty dock, the truck places preference on the higher-numbered dock (3, 2, 1). If all the docks are busy, it chooses the dock with the minimum number of trucks waiting. If there is a tie, it places preference on the lowest numbered dock (1, 2, 3). Note that in “by Condition” Decide modules, the tests are done from top to bottom, and the f rst one resulting in a “true” sends the entity out through that corresponding exit point. Run your model for a single replication of length 20,000 minutes and collect statistics on dock utilization, number in queue, time in queue, and the time in system. Put a text box in your Arena f le with, separately for each of the three docks, the utilization of that dock resource, the time-average number kel01315_ch05_207-278.indd 271 05/12/13 3:28 PM 272 Chapter 5 of trucks in that queue, the average time of trucks in that queue, and the average time in system of trucks going through that dock.