Maximizing the Total Weight of Just-In-Time Jobs under Multi-Slot Conditions Is NP-Hard.

Eishi Chiba Shinji Imahori

Published in: IEICE Trans. Inf. Syst. (2016)

Keyphrases

np hard
total weight
optimal solution
special case
worst case
strongly np hard
scheduling problem
processing times
computational complexity
higher order
approximation algorithms