DSpace

King Saud University Repository >
King Saud University >
COLLEGES >
Science Colleges >
College of Engineering >
College of Engineering >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/13036

Title: Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times
Authors: Gharbi, A
Ladhari, T.,
Msakni, M.K.,
Serairi, M..
Keywords: Flowshop; Lower bounds; Setup times; Total completion time
Issue Date: 2010
Publisher: Elsevier Ltd.
Citation: Electronic Notes in Discrete Mathematics, 36 (C), pp. 1089-1096.
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.
URI: http://hdl.handle.net/123456789/13036
ISSN: 15710653
Appears in Collections:College of Engineering

Files in This Item:

File Description SizeFormat
2.doc41 kBMicrosoft WordView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

DSpace Software Copyright © 2002-2007 MIT and Hewlett-Packard - Feedback