TY  - JOUR
U1  - Zeitschriftenartikel, wissenschaftlich - begutachtet (reviewed)
A1  - Sterna, Malgorzata
A1  - Chen, Xin
A1  - Wang, Zhongyu
A1  - Pesch, Erwin
A1  - Blazewicz, Jacek
T1  - Two-machine flow-shop scheduling to minimize total late work
BT  - revisited
JF  - Engineering Optimization
N2  - This article revisits the scheduling problem in a two-machine flow-shop system with the total late work criterion, which penalizes parts of jobs executed after their due dates. Firstly, it is shown that a lower bound presented previously in the literature, in the context of a branch-and-bound algorithm proposed for the same problem, is ialid. Then a novel proposal of the branch-and-bound method is given equipped with a new lower-bound technique, as well as an upper-bound and dominance rules. Numerical experiments show that the newly proposed lower-bound technique works well in cutting unpromising branches.
Y1  - 2019
SN  - 0305-215X
SS  - 0305-215X
U6  - https://doi.org/10.1080/0305215X.2018.1519073
DO  - https://doi.org/10.1080/0305215X.2018.1519073
VL  - 51
IS  - 7
SP  - 1268
EP  - 1278
ER  -