In static planning, schedules are generated for a certain finite planning horizon. The duration of the planning process is bounded by the time between data collection and the start of transportation processes. Given the input data, a static planning system must be capable of calculating high quality solutions in the time available for optimisation.
In dynamic planning, the planning horizon may neither be bounded, nor known. In fact, a typical dynamic planning scenario is that of an open-ended process, going on for an indefinite period of time. Usually, near-term events are more important than long-term events. The consideration of requirements, which have to be satisfied way into future, would not be very wise, because such future information may change anyway. In a typical rolling horizon framework only information relevant to planning decisions within a horizon of a certain length is considered. As time unfolds, parts of the tentative schedule are applied and new information may enter the planning horizon.