Bounding strategies for obtaining a lower bound for N-job and M-machine flowshop scheduling problem with objective of minimising the total flowtime of jobs. (8th June 2021)

• Record Type: Journal Article
• Authors: Kumar, S. Saravana; Rajendran, C.; Leisten, Rainer
• Is Part Of: International journal of operational research. Volume 41:Number 2(2021)
• Page Start: 244
• Page End: 269
• Publication Date: 2021-06-08
• Subjects: scheduling -- flowshop -- total flowtime of jobs -- lower bound; Operations research -- Periodicals; 003.05
• Languages: English
• ISSNs: 1745-7645

Abstract

In this paper, bounding strategies for determining a lower bound on the completion time of a job sequenced in each position in the permutation sequence on each machine in permutation flowshop scheduling problem with minimisation of total flowtime of jobs as objective are discussed. Basically, the bounding strategies are machine-based bounding strategies used for determining the lower bound on total flowtime of jobs for all the small-sized and large-sized benchmark flowshop scheduling problem instances proposed by Vallada et al. (2015). The lower bound matrix can be pruned as tightening constraints into the mixed integer linear programming (MILP) model with objective of minimisation of total flowtime of jobs. Since the flowshop scheduling problem with total flowtime objective is difficult, two kinds of linear programming (LP) relaxation methods are used for determining an LP-based lower bound on total flowtime of jobs for some benchmark problem instances proposed by Vallada et al. (2015).