This paper concerns a case study for optimal planning and coordination of railway maintenance windows and train traffic. The purpose is to validate a previously presented optimization model on a demanding real-life problem instance and to obtain results that apply in similar planning situations. A mixed integer linear programming model is used for a 913 km long, single-track railway line through the northern part of Sweden, with traffic consisting of 82 trains per day, most of which are freight trains. Cyclic 1-day schedules are produced, which show that 2 h long maintenance windows can be scheduled with small adjustments of the train traffic. The sensitivity for cost changes is studied, which shows that the train costs must increase by more than 30% in order to change the structure of the window solutions. Resource efficient window schedules are obtained by assigning maintenance teams to all windows while respecting crew work and rest time restrictions. A comparison with manually constructed plans from the Swedish Transport Administration indicates that larger window volumes can be scheduled at a lower cost and with solution structures which are deemed reasonable and useful as guidance for constructing the real window patterns. Finally, we estimate that using an integrated planning approach (where maintenance and trains are jointly planned) instead of a sequential approach (where a train timetable has precedence over the maintenance windows), will give maintenance cost savings of 11–17%, without incurring any large cost increases for the train traffic. The paper also presents a method for achieving cyclic schedules without any period-deciding variables, and discusses the consequences of the aggregated capacity usage model that has been adopted. © 2020, The Author(s).