It　is　challenging　to　perform　emergency　scheduling　for　fighting　forest　fires　subject　to　limited　rescue　resources　(i.e.,　vehicles　with　fire　engines),　since　extinguishing　each　fire　point　should　take　into　account　multiple　factors,　such　as　the　actual　fire　spreading　speed,　distance　from　fire　engine　depot　to　fire　points,　fire-fighting　speed　of　fire　engines,　and　the　number　of　dispatched　vehicles.　This　paper　investigates　a　bi-objective　rescue　vehicle　scheduling　problem　for　multi-point　forest　fires,　which　aims　to　optimally　dispatch　a　limited　number　of　fire　engines　to　extinguish　fires.　The　objectives　are　to　minimize　the　total　fire-extinguishing　time　and　the　number　of　dispatched　fire　engines.　For　this　problem,　we　first　develop　an　integer　program　that　is　an　improved　and　simplified　version　of　an　existing　one.　After　exploring　some　properties　of　the　problem,　we　develop　an　exact　dynamic　programming　algorithm　and　a　fast　greedy　heuristic　method.　Computational　results　for　a　real-life　instance,　and　benchmark　and　large-size　randomly　generated　instances　confirm　the　effectiveness　and　efficiency　of　the　proposed　model　and　algorithms.　Besides,　a　bi-objective　integer　program　is　developed　to　address　the　multi-depot　fire　engine　scheduling　issue.