Modelling and solution of a multi-resources dynamic scheduling problem with time windows

The multi-resources scheduling with time windows is a complex process including resources allocation and time windows allocation. The initial schedule may not be valid because some resource is broken down during the process of its executing and it needs to be adjusted. This paper analyzes the main kinds of constraints of the dynamic scheduling of multi-resources with time windows based on the instance and modelling. It gives a heuristic search method to develop the model. An example of parallel machine scheduling with time windows to validate the model is given.