This paper presents a new mixed-integer linear program (MILP) formulation for modeling sequence-dependent switchovers for uniform discrete-time scheduling problems. The new formulation provides solutions faster than the formulation found in the paper by Kondili et al. (Comput. Chem. Eng. 1993, 17, 211) and scales more efficiently. The key to this formulation is the use of memory operation logic variables that track the temporal unit-operation events occurring within the scheduling horizon for each unit. Four auxiliary dependent binary transition variables are required for every unit-operation independent binary variable, called the mode-operation setup variable. In this paper, "dependent" means that these variables are derived from the unit-operation variables and are integral at the solution without explicitly declaring them as binary search variables in the MILP formulation, hence reducing the computational effort. The four dependent variables are the startup, shutdown, switchover-to-itself, and memory operation logic variables. The sequence-dependent switchover relationships between different operations on the same unit can be derived from these variables, whereby maintenance operations can be activated and placed between the mode operations where appropriate, depending on the repetitive maintenance or cleaning requirements. The new formulation for sequence-dependent switchovers can be applied to both batch- and continuous-process units. Three illustrative examples are provided that show its advantage in terms of solution times over current state-of-the-art methods. In addition, effective integer cuts are derived, which are based on the asymmetric traveling salesman problem with costs equal to the sequence-dependent transition times.