In scheduling, online reassignment means, that during the online scheduling process, some jobs can be reassigned from one machine to another (in a bounded way), or a buffer can be used which can store temporarily some jobs, or at the end of the scheduling process some jobs can be reassigned. Clearly, this is some kind of semi-online scheduling. The option of reassignment makes the scheduling problem to be better handable; if we measure the goodness of an algorithm with competitive ratio (which is some kind of worst case preformance ratio), this means that the semi online condition decreases the competitive ratio what can be reached by an (optimal) algorithm. We treat and compare to each other some such reassignment conditions in case of a (fundamental) scheduling problem.