New complexity results for shop scheduling problems with agreement graphs.

Nour El Houda Tellache

Published in: Theor. Comput. Sci. (2021)

Keyphrases

scheduling problem
worst case
computational cost
single machine
space complexity
job shop
distributed sensor networks
decision problems
directed graph
bipartite graph
graph partitioning
representational power
polynomial time complexity