On the NP-hardness of scheduling with time restrictions.

An Zhang Yong Chen Lin Chen Guangting Chen

Published in: Discret. Optim. (2018)

Keyphrases

np hardness
np hard
scheduling problem
approximation algorithms
resource constraints
scheduling algorithm
mixed integer
worst case analysis
lower bound
optimal solution
discrete tomography
decision making
linear programming
knapsack problem