This paper proposes a two-phase heuristic algorithm to solve the crew scheduling problem of the Megabus Bus Rapid Transit System.In the first stage, a division of the original schedules is performed using a recursive algorithm based on dynamic scheduling.In the second stage, workshift construction based on graph theory is performed using a pairing algorithm (i.e., matching).The method is validated by applying it to the mass transit system of the Central Western Metropolitan Area (AMCO), operated by Integra SA, which serves 11 routes for a daily total of 2899 trips..