How the structure of precedence constraints may change the complexity class of scheduling problems
Résumé
This survey aims at demonstrating that the structure of precedence constraints plays a tremendous role on the complexity of scheduling problems. Indeed many problems can be N P-hard when considering general precedence constraints, while they become polynomially solvable for particular precedence constraints. Add to this, the existence of many very exciting challenges in this research area is underlined.
Domaines
Recherche opérationnelle [math.OC]
Origine : Fichiers produits par l'(les) auteur(s)