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

Journal Article

Gharbi, Anis . 2010

• رابط المنشور على الويب: Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times
• الوسوم: Flowshop, setup times, total completion time, lower bounds
• المجلة \ الصحيفة: Electronic Notes in Discrete Mathematics
• رقم الإصدار السنوي: 36
• الصفحات: 1089–1096

مستخلص المنشور

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.