This dissertation suggests a model to generate cyclic tugger train schedules with static routes within the operational logistics planning. Two mathematical optimization problems form the core results of this dissertation which allow the generation of non-overlapping schedules which can be carried out with a minimum number of tugger trains. To solve the overall planning model for cycle time and timetable planning, an optimal solution algorithm is presented and evaluated using two applications from the automotive industry.     «

This dissertation suggests a model to generate cyclic tugger train schedules with static routes within the operational logistics planning. Two mathematical optimization problems form the core results of this dissertation which allow the generation of non-overlapping schedules which can be carried out with a minimum number of tugger trains. To solve the overall planning model for cycle time and timetable planning, an optimal solution algorithm is presented and evaluated using two applications fro...     »