Software Stability Model for Dump Truck Scheduling
OOPSLA DesignFest® 2001 (Tuesday afternoon)...
Problem:
- Produce an acceptable schedule for the pickup and delivery of waste
and ore given the topology of the mining site. (In particular, distances
between material processing facilities, waste dumps and loading shovels.
Contraints:
- Minimize Cost
- Meet "production" volume requirements
- Avoid idle trucks
- Material source sites can only service one truck at a time
Solution:
- Model physical entities to allow for "pluggable" solver
- Provide solver based on "greedy method" for customer experimentation
Various Ideas/Notes:
- given an available transport
- determine 'best' location
- send transport to that location
'greedy' algorithm
possiblities:
source with shortest wait time, most remaining quota, & (tie breaker>
shortest distance
shortest time to load
Participants:
- David Shaffer
- Teresa Nieten
- Majid Nabavi (Customer)
- Kelly Leombruno
- Ralph Johnson (Moderator)
- Allan Iverson
- Steve Burgess (Recorder)