In many regional areas where passenger transportation by rail is available, the development of activities outside the individual’s residential location following environmentally sustainable parameters could be potentiated by setting a well-organized timetable of services addressing two crucial aspects: quality of the connectivity between stations and the length of the period at the destination. i.e., the last time service to return home. In this paper a non-periodical timetable model is developed at a tactical level, in the form of a mixed linear integer programming problem, for addressing the two previous questions. The model considers all the circulations in an operational horizon (typically a day) on a regional network, where lines with many services coexist with lines with much less services. The model sets the scheduling of arrivals and departures taking into account operational aspects such as headways, capacities and transfer times between services at stations. A preprocessing phase consisting of two steps based on a simplified version of a strategic timetable (SPOT) model is used to determine realistic upper bounds on the minimum travel times using transfers at a subset of chosen transfer stations. Results will be presented for a set of medium size test areas presenting the characteristics previously described and for different levels of congestion.