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

2016 IEICE transactions on information and systems  
A job is called just-in-time if it is completed exactly on its due date. Under multi-slot conditions, each job has one due date per time slot and has to be completed just-in-time on one of its due dates. Moreover, each job has a certain weight per time slot. We would like to find a just-intime schedule that maximizes the total weight under multi-slot conditions. In this paper, we prove that this problem is NP-hard.
doi:10.1587/transinf.2015edl8171 fatcat:koepu73vj5dqfolnxbw46x3yhy