Two-machine robotic cell scheduling problem with sequence-dependent setup times

► We define a new problem: two-machine robotic cell with sequence-dependent setup times. ► We prove the problem is NP-hard and develop a new MILP model to give exact solutions. ► A Simulated Annealing, tuned via Taguchi method, and Branch and Bound are used. ► We develop a lower bound and prove that its accuracy. ► SA results are close to exact solutions and lower bounds even in large problems.