Given a flight schedule, which is a set of flight segments with specif
ied departure and arrival times, and a set of aircraft, the fleet assi
gnment problem is to determine which aircraft type should fly each fli
ght segment. The objective is to maximize revenue minus operating cost
s. In the basic fleet assignment problem considered by Hane et al. (19
95) a daily, domestic fleet assignment problem is modeled and solved w
ith up to eleven fleets and 2,500 flight legs. This paper provides mod
eling devices for including maintenance and crew considerations into t
he basic model while retaining its solvability.