Research Information System
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, vol.22, no.4, pp.1905-1927, 2026 (SCI-Expanded, Scopus)
We address the two-machine flow shop scheduling problem with the objective of minimizing total tardiness, where setup times are modeled as uncertain. Accordingly, setup times are represented using lower and upper bounds without assuming any probability distribution. We first develop a mathematical dominance relation for the problem and then present two novel heuristic algorithms that incorporate this dominance relation. Through extensive computational experiments using multiple problem sizes, due-date settings, and both symmetric and extreme uncertainty distributions, supported by statistical hypothesis testing, we show that both proposed algorithms significantly outperform the best existing algorithm in the literature. In particular, the computational results indicate that the error of the leading algorithm in the literature is approximately 38 to 115 times larger than that of our proposed algorithms.