“…• T(S k ) denotes the station time, the total operation time of tasks assigned to station k, and must not exceed the cycle time: In UALBP, each task and any of its predecessors and/or successors can share the same station but it must be satisfied that, all predecessors and/or successors of a task j, performed at station k, have to be assigned to one of the stations 1,…, k. (Miltenburg and Wijngaard, 1994). In Figure 1.3 the optimal solution of UALBP-1 for c = 10, with 6 stations is given.…”