In this paper, we propose a new linear programming-based approach that enables the consideration of technical car sequencing rules in the master production scheduling of mixed-model assembly lines at a much higher level of detail than previous approaches. To this end, we investigate certain...

Lift-and-project (L &P) cuts are well-known general 0–1 programming cuts which are typically deployed in branch-and-cut methods to solve MILP problems. In this article, we discuss ways to use these cuts within the framework of Benders' decomposition algorithms for solving two-stage...