@article{SternaChenWangetal.2019,
  author    = {Malgorzata Sterna and Xin Chen and Zhongyu Wang and Erwin Pesch and Jacek Blazewicz},
  title     = {Two-machine flow-shop scheduling to minimize total late work},
  series   = {Engineering Optimization},
  volume    = {51},
  number    = {7},
  issn      = {0305-215X},
  doi       = {10.1080/0305215X.2018.1519073},
  pages     = {1268 -- 1278},
  year      = {2019},
  abstract  = {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.},
  language  = {en}
}