Multimode Time-Constrained Scheduling Problems with Generalized Temporal Constraints and Labor Skills

Tamara Borreguero Sanchidrián (1, 2) , Christian Artigues (3) , Alvaro García Sánchez (1) , Miguel Ortega Mier (1) , Pierre Lopez (3)

1 Polytecnic University of Madrid
2 Airbus Defence and Space
3 LAAS-ROC - Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes

In this work, we have solved a Time-Constrained Scheduling Problems (TCSP) related to the scheduling of tasks to be done on a platform from an aircraft Final Assembly Line. It is a multimode TCSP with generalized temporal constraints and several labor skills. We have developed two MILP event-based formulations that provide us with an exact MILP formulation for the TCSP. We also use constraint programming to solve the problem, in order to be able to compare the performance of both types of paradigms and, ultimately, to hybridize them.

Mots clés: Time-Constrained Scheduling Problem; Mixed-Integer Linear Programming; Constraint Programming; Aircraft Assembly

Domaines: Recherche opérationnelle [math.OC]

Tamara Borreguero Sanchidrián, Christian Artigues, Alvaro García Sánchez, Miguel Ortega Mier, Pierre Lopez. Multimode Time-Constrained Scheduling Problems with Generalized Temporal Constraints and Labor Skills. 7th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2015), Aug 2015, Prague, Czech Republic. pp.809-813. ⟨hal-01232879⟩