Scheduling model for systems with complex alternative behaviour

In this paper we propose a flexible model for scheduling problems, which allows the modeling of systems with complex alternative behaviour. This model could for example facilitate the step from process planning model to optimization model. We show how automatic constraint generation can be performed for both Constraint Programming and Mixed Integer Linear Programming (MILP) models. Also, for the MILP case, a new formulation for mutual exclusion of resources is proposed. This new formulation works well for proving optimality in systems with multiple capacity resources. Some benchmarks for such job shop scheduling problems as well as systems with a large number of alternatives are also presented.