“…., n t min , t max , t sum Minimal, maximal, total task time p j Station requirement of task j; p j = t j /c P j ðP Ã j Þ Set of direct (all) predecessors of task j F j ðF Ã j Þ Set of direct (all) followers of task j S k , t (S k ) Station load, station time of station k; tðS k Þ ¼ P j2Sk t j , k = 1,. . ., m I k Idle time of station k; I k = cÀt (S k ) a j , n j Head, tail of task j E j , L j Earliest, latest station for task j Former surveys covering SALBP procedures are given by Buxey et al (1973), Baybars (1986a), Shtub and Dar-El (1989), Ghosh and Gagnon (1989), Sarin (1998), Scholl (1999, Chapter 1) as well as Rekiek et al (2002b).…”