Approach by localization and genetic manipulation algorithm for flexible job-shop scheduling problem

Traditionally, assignment and scheduling decisions are separately made at different levels of the production management framework. The combining of these decisions presents additional complexity and new problems. We present two approaches to solve the assignment and job-shop scheduling problems (with total or partial flexibility). The first one is the approach by localization : it makes it possible to solve the problem of resources allocation and build an ideal assignments model (assignments scheme). The second one is an evolutionary approach controlled by the assignments model (generated by the first approach). In this approach, we apply advanced genetic manipulations in order to enhanced solutions quality. We Also explain some of the practical and theoretical considerations to the construction of a more robust encoding that will allow us to consider the sequencing and the assignment problems jointly.