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

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

Title: Lower bounds for scheduling on identical parallel machines with heads and tails
Authors: Haouari, M.
Gharbi, A.
Keywords: Delivery times; Identical parallel machines; Lower bound; Makespan; Release dates; Scheduling
Issue Date: 2004
Publisher: Kluwer Academic Publishers
Citation: Annals of Operations Research, 129 (1-4), pp. 187-204.
Abstract: In this paper, we investigate new lower bounds for the P|rj, qj|Cmax scheduling problem. A new bin packing based lower bound, as well as several new lifting procedures are derived for this strongly NP-hard problem. Extensive numerical experiments show that the proposed lower bounds consistently outperform the best existing ones.
URI: http://hdl.handle.net/123456789/13045
ISSN: 02545330
Appears in Collections:College of Engineering

Files in This Item:

File Description SizeFormat
11.doc44.5 kBMicrosoft WordView/Open

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


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