A job is called just-in-time if it is completed exactly on its due date. Under multi-slot conditions, each job has a due date per slot, and has to be completed just-in-time on one of its due dates. We would like to find a just-in-time schedule that maximizes the total weight under multi-slot conditions. In this paper, we prove that this problem is NP-hard.