Schedule Nervousness Reduction in Transport RePlanning

This article reports about investigations on a transport scheduling scenario. The generated schedule requires a repeated revision in order to incorporate additionally rel eased requests. Neither the release time nor the location of the as sociated customer site can be forecasted. Special attention i s paid to keep the generated schedules stable, which means that onc e made scheduling decisions should be maintained (announced arrival times at customer sites, etc.) Initially, several m easures for the nervousness degree are proposed. In computational s mulations it turns out that a very high nervousness degree appears if the same schedule update strategies are applied for different workloads. As a remedy, the adaptation of the used schedule update strategy to the current schedule performan ce is proposed. A prototypic algorithm framework is presented an assessed is comprehensive numerical simulation experimen ts. The adaptation of the schedule update strategies contribut es to a significant reduction of some observed nervousness degree s. It reinforces the preservation of once fixed arrival times at customer sites.