The Tactical Fixed Interval Scheduling Problem (TFISP) is the problem of determining the minimum number of parallel nonidentical machines, such that a feasible schedule exists for a given set of jobs.

We study the complexity of the problem, and develop a solution algorithm using greedy randomised adaptive search. A case study of real-life data from Stockholm Arlanda Airport shows that optimised ...