Modeling and solving a multi-resource dynamic scheduling problem with time windows

The multi-resources scheduling with time windows is a complex process, which includes resources allocation and time windows allocation. To get the most optimal schedule, the initial schedule must be adjusted because of new tasks' arriving in the whole period. This paper analyzes the main constraints of this problem, constructs a multi-resources dynamic scheduling model with time windows and gives a heurisitc iterative repair algorithm to solve the model. Finally we give an example of the parallel machine scheduling with time windows to validate the model and solution.