One of the main characteristics of personnel scheduling problems is the multitude of rules governing schedule feasibility and quality. This talk deals with an issue in personnel scheduling which is both relevant in practice and often neglected in academic research: When evaluating a schedule for a given planning period, the scheduling history preceding this period has to be taken into account. On the one hand, the history restricts the space of possible schedules, in particular at the beginning of the planning period and with respect to rules with a scope transcending the planning period. On the other hand, the schedule for the planning period under consideration affects the solution space of future planning periods. In particular if the demand in future planning periods is subject to uncertainty, an interesting question is how to account for these effects when optimizing the schedule for a given planning period. The resulting planning problem can be considered as a multistage stochastic optimization problem which can be tackeled by different modeling and solution approaches. In this paper, we compare different deterministic lookahead policies in which a one-week scheduling period is artificially extended by an artifical lookahead period. In particular, we vary both the length and the way of creating demand forecasts for this lookahead period. The evaluation is carried out using a stochastic simulation in which weekly demands are sampled and the scheduling problems are solved exactly using mixed integer linear programming techniques. Our computational experiments based on data sets from the Second International Nurse Rostering Competition show that the length of the lookahead period is crucial to find good-quality solutions in the considered setting.