We address two variants of accessibility window assembly line balancing, AWALBP-L2. We propose a new MILP model for AWALBP-L2-1 (tasks preassigned to workstations). Our MILP model outperforms previously proposed MILP models and heuristic methods. We extend the model to solve AWALBP-L2-M (tasks compatible with many workstations). Computational experiments for AWALBP-L2-M show that it is much harder to solve.