We introduce Mixed Integer Linear Programming (MILP) formulations for the two-stage robust surgery scheduling problem (2SRSSP). We derive these formulations by modeling the second-stage problem as a longest path problem on a layered acyclic graph and subsequently converting it into a linear program. This linear program is then dualized and integrated with the first-stage, resulting in a MILP formulation for 2SRSSP. Additionally, we propose methods to improve the computational performance of the these MILP formulations. An extensive numerical study, based on data from an academic medical center, reveals that the computational performance of the Column and Constraint Generation (C&CG) Algorithm, the only exact method previously applied to this problem in the literature, is outperformed by at least one of the MILP formulations we introduce in this paper.