No-wait two-stage flowshop problem with multi-task...
By Lemmas 4.2 and 4.3, the total overlapping time between M1 and M2 can be lower bounded aso⩾minb1,∑ℓ∈[2,k-1]pℓ+b2-12∑ℓ∈[k]bℓ⩾∑ℓ∈[2,k-1]bℓ+b2-12∑ℓ∈[k]bℓ=b2-b12+12∑ℓ∈[2,k-1]bℓ-12bk⩾b2-b12+12∑ℓ∈[2,k-2]bℓ⩾b2...