Dynamic scheduling for heterogeneous resources with time windows and precedence relation

摘要

We consider dynamic scheduling for heterogeneous resources in flexible manufacturing systems. The resources are mobile robots with different capabilities and/or people with different skills. The tasks in the system arise over time and each has a time window for completion. We have developed a method for dynamic scheduling based on mixed integer programming and rolling horizon. The results show it can solve practical scheduling problems fast, and can significantly reduce the cost when compared to current practice.