Temporal graphs have been recently introduced to model changes to a given network that occur throughout a fixed period of time. The Temporal $Δ$ Clique problem, that generalizes the well known Clique problem to temporal graphs, has been studied in the context of finding nodes of interest in dynamic networks [TCS '16]. We introduce the Temporal $Δ$ Independent Set problem, a temporal generalization of Independent Set. This problem is e.g. motivated in the context of finding conflict-free schedules for maximum subsets of tasks, that have certain (changing) constraints on each day they need to be performed. We are specifically interested in the case where each task needs to be performed in a certain time-interval on each day and two tasks are in conflict on a certain day if their time-intervals on that day overlap. This leads us to considering both problems on the restricted class of temporal unit interval graphs, i.e., temporal graphs where each layer is a unit interval graph. We present several hardness results as well as positive results. On the algorithmic side, we provide constant-factor approximation algorithms for instances of both problems where $τ$, the total number of time steps (layers) of the temporal graph, and $Δ$, a parameter that allows us to model conflict tolerance, are constants. We develop an exact FPT algorithm for Temporal $Δ$ Clique with respect to parameter $τ+k$. Finally, we use the notion of order preservation for temporal unit interval graphs that, informally, requires the intervals of every layer to obey a common ordering. For both problems we provide an FPT algorithm parameterized by the size of minimum vertex deletion set to order preservation.