Airport situations are widely studied allocation problems, with the aim of providing simple and fair allocation for the landing fees. In the airport situations, different airline firms use the airstrips of different lengths. As expected, a larger plane needs a longer airstrip. In the sequel if a plane is served by an airstrip, then all the other smaller planes are served by the same airstrip. To accommodate all these planes, the airstrip must be long enough for the largest plane. This paper deals with the research area of cooperative games arising from airport situations with fuzzy data. We deal with airport situations, where the costs of the pieces of the runway are chosen as fuzzy intervals. Also, we study some properties of airport situations as an allocation problem. On the other hand we extend Baker-Thompson rule under fuzzy uncertainty and introduce the fuzzy interval Baker-Thompson rule. The main result of this study is to give an axiomatic characterization of this rule.