Recently integer linear programming techniques have been proposed to solve the single iteration scheduling problem. In this paper, we generalize the integer linear programming formulation to support unfolded schedules. We present a new time assignment formulation which automatically pipelines and re-times the DFG. We present a new processor allocation formulation which automatically unfolds the DFG. Although unfolding was proposed before for reducing the iteration period, this paper, for the first time, proposes systematic unfolding for improving processor utilization in digital signal processing architectures. These models fully optimize the processor utilization for a specific iteration period.