Abstract⎯This research develops several network models for carriers that both efficiently and effectively adjust schedule resulting from the expected aircraft shortage for the operation of multiple fleets as well as non-stop and one-stop flights. These models are formulated as pure network flow problems or multi-commodity network flow problems. The former are solved using the network simplex method while the latter are solved using a Lagrangian relaxation-based algorithm. A case study regarding the international operations of a major Taiwan airline is presented.