Consider the article, "A Truck Scheduling System Improves Efficiency in the Forest Industries," by Weintraub et.al. and answer the following questions. The article appears in Interfaces vol. 26 no. 4, July-August 1996, pp 1-12. A copy of the article is located on Reserve in Hunt Library, behind the circulation desk on the first floor and the journal is located in the Bounded Journals section of Hunt Library on the third floor.
We will illustrate the algorithm discussed in this paper by looking at the following scenario. The table below gives the demands, supplies and truck availability for the hour 1:00-2:00pm.
| Demands | ||||||
|---|---|---|---|---|---|---|
| 50 | 40 | 30 | 25 | 75 | ||
| S u p p l i e s |
30 | No Trucks available | Truck 1 arrives at O1 at 1:15 with index 10 |
Truck 1 arrives at O1 at 1:30 with index 20 |
Truck 1 arrives at O1 at 1:30 with index 30 |
No Trucks available |
| 60 | Truck 2 arrives at O2 at 1:30 with index 20 |
No Trucks available | No Trucks available | Truck 1 arrives at O2 at 1:30 with index 10 Truck 2 arrives at O2 at 1:15 with index 15 Truck 3 arrives at O2 at 1:15 with index 20 |
Truck 2 arrives at O2 at 1:45 with index 15 |
|
| 35 | No Trucks available | Truck 3 arrives at O3 at 1:25 with index 15 |
Truck 3 arrives at O3 at 1:15 with index 10 |
No Trucks available | Truck 3 arrives at O3 at 1:10 with index 15 |
|
We also have the information that