How the structure of precedence constraints may change the complexity class of scheduling problems
Computational Complexity
2017-01-25 v3
Abstract
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 NP-hard when considering general precedence constraints, while they become polynomially solvable for particular precedence constraints. We also show that there still are many very exciting challenges in this research area.
Keywords
Cite
@article{arxiv.1510.04833,
title = {How the structure of precedence constraints may change the complexity class of scheduling problems},
author = {Damien Prot and Odile Bellenguez-Morineau},
journal= {arXiv preprint arXiv:1510.04833},
year = {2017}
}