Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times

Journal Article

Gharbi, Anis . 2010

• Publication Online URL: Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times
• Tags: Flowshop, setup times, total completion time, lower bounds
• Magazine \ Newspaper: Electronic Notes in Discrete Mathematics
• Volume Number: 36
• Pages: 1089–1096

Publication Abstract

In this paper, we address the problem of two-machine flowshop scheduling problem with sequence independent setup times to minimize the total completion time. We propose five new polynomial lower bounds. Computational results based on randomly generated data show that our proposed lower bounds consistently outperform those of the literature.