“…These are based on the design of saturated schedules and use mathematical programming models that achieve a high degree of saturation and simultaneously ensure certain level of quality of service (Canca et al, 2014a). Different techniques have been used for this purpose: branch-and-bound (Szpigel, 1972;Jovanovic and Harker, 1991), heuristic algorithms (Cai and Goh, 1994;Carey and Lockwood, 1995), tabu search (Higgins et al, 1996), Lagrangian relaxation (Caprara et al, 2000), and linear programming (Mussone and Wolfter Calvo, 2013).…”