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

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

Full description

Saved in:
Bibliographic Details
Published in:Electronic notes in discrete mathematics 2010-08, Vol.36, p.1089-1096
Main Authors: Gharbi, Anis, Ladhari, Talel, Msakni, Mohamed Kais, Serairi, Mehdi
Format: Article
Language:English
Subjects:
Flowshop
lower bounds
setup times
total completion time
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2010.05.138