This is the original constraint from the paper that I am trying to reproduce in Julia (did in GAMS).
np is an alias of n that is used in the model. elements in n are is a time/event point (model is a scheduling problem) and it is needed that when indexing from both sets that np and n not be the same i.e when n = 1, np != 1 and so forth. Hope I am making sense.