
Scheduling a dynamic job shop consisting of several multi-purpose machines is a complex combinatorial problem. We will develop mathematical optimization models and study possible solution methods, both analytical and heuristic methods with the aim of developing a fast algorithm that solves this type of flexible job shop scheduling problems within an acceptable time frame so that it is possible to implement in practice.
Vetenskapsrådet, NFFP (Nationellt Flygtekniskt ForskningsProgram), GKN Aerospace