A constraint programming model for the flexible job shop scheduling problem with sequencing flexibility and position based learning effects

This paper addresses the flexible job shop scheduling problem with sequencing flexibility (FJS-SF) and learning effects with the objective of makespan minimization. Mixed integer linear programming (MILP) and constraint programming (CP) models are proposed to solve the problem for the position based learning effects. Computational experiments show that CP model is more efficient than MILP model to solve the problem.