摘要

This work is concerned with a scheduling problem where elements executing transport and production tasks can move. Scheduling and control are interconnected. To derive a schedule, knowledge about movement times is essential. Likewise, control requires routes which are the result of scheduling. In this work, presented was a comparison of two solution algorithms: an algorithm with decomposition and an iterative algorithm. Deliberation was presented on a vehicle with a three-wheeled movement model. (Scheduling problem where elements executing transport and production tasks can move)

  • 出版日期2010