Flexible Job Shop Models for Solving Scheduling and Layout Problems Using Coloured Petri Nets

In this paper we propose models for solving both the layout manufacturing problems and the scheduling manufacturing systems. These models are based on Coloured petri Nets. The particularity of our models is the possibility to include complex programmable functions inside the petri nets models. In our case the programming language is SML/NJ. The advantage of programming language is the possibility to use Heuristics or Meta-heuristic optimization methods inside the Coloured Petri Nets (CPN) model without the necessity to relaunch the simulation of the model at each step of optimization. For describing, analysing and simulating our models we will use CPN Tools.