The log truck scheduling problem under capacity constraints and time window constraints is an NP-hard problem that involves the design of best possible routes for a set of trucks serving multiple loggers and mills. The objective is to minimize the total unloaded miles traveled by the trucks. In this paper a simulated annealing - a meta-heuristic optimization method - that interacts with a deterministic simulation model of the log transport system in which the precedence and temporal relations among ...