“…The SALBP consists in assigning a set of operations to identical consecutive stations minimizing the number of stations required, subject to precedence (between operations) and cycle time constraints. The principal approaches used in the literature for SALBP are: Lagrange relaxation techniques (Aghezzaf and Artiba, 1995), Branch and Bound algorithms, see for example (van Assche and Herroelen, 1979;Ugurdag et al, 1997;Scholl and Klein, 1998), heuristics and meta-heuristics (Arcus, 1966;Helgeson and Birnie, 1961;Rekiek et al, 2001). A state-of-the-art is presented in Baybars (1986), Becker and Scholl (2006), Erel and Sarin (1998), Ghosh and Gagnon (1989) and Rekiek et al (2002).…”