Multimode Time-Constrained Scheduling Problems with Generalized Temporal Constraints and Labor Skills
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...