This paper proposes an iterative branch-and-bound (IB&B) approach for complex product assembly station scheduling problems (CPASSP) to minimize the total weighted tardiness (TWT). First, an iterative ...