In the last decades, natural disasters, such as earthquakes and landslides, have occurred frequently, seriously threatening the safety of people’s lives and property. How emergency material is scheduled and delivered efficiently to the affected sites after a disaster has become a critical issue in emergency management. Current studies on emergency material scheduling mainly focus on truck or helicopter transport. Inspired by the success of employing drones in commercial logistics, this work investigates the emergency material scheduling issue based on the cooperative transport of drones, helicopters, and trucks. Specifically, this paper considers the limited transport capacity, road conditions in the early stage of the disaster rescue, and affected sites restricted by road conditions that can only be served by helicopters or drones. The studied problem is formulated as a mixed integer programming model, and a two-stage heuristic algorithm is developed to solve the model. For the proposed model, instances of different sizes are generated, and extensive experiments are performed to test the efficiency of the proposed algorithm. The comparison between the solutions obtained by the two-stage algorithm and Gurobi Solver for the small instances validates the effectiveness of the proposed heuristic algorithm. Experimental results for the larger instances show that the proposed two-stage algorithm can effectively solve the problem of emergency material scheduling. Sensitivity analysis of ten typical instances is performed to provide managerial insights. Finally, a case study of the Sichuan earthquake and the visualization of transport routes are presented. The model and solving approach proposed in this work can provide essential decision references for emergency management decision-making.