Two-machine flow-shop scheduling to minimize total late work: revisited. Issue 7 (3rd July 2019)

• Record Type: Journal Article
• Authors: Chen, Xin; Wang, Zhongyu; Pesch, Erwin; Sterna, Malgorzata; Błażewicz, Jacek
• Is Part Of: Engineering optimization. Volume 51:Issue 7(2019)
• Page Start: 1268
• Page End: 1278
• Publication Date: 2019-07-03
• Subjects: Late work -- flow shop -- branch-and-bound algorithm; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2018.1519073
• Languages: English
• ISSNs: 0305-215X

Abstract

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 invalid. 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.