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/13041

Title: An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
Authors: Gharbi, A
Haouari, M.
Keywords: Delivery times; Heuristic; Identical parallel machines; Release dates; Scheduling
Issue Date: 2007
Publisher: Elsevier Ltd.
Citation: Computers and Operations Research, 34 (3), pp. 868-883.
Abstract: We address the makespan minimization for parallel identical machines subject to heads and tails. This problem is NP-hard in the strong sense. We show that the worst-case performance of Jackson's algorithm is improved by using a preprocessing algorithm, and we propose an approximate decomposition algorithm which requires iteratively solving a sequence of two-machine problems. We present the results of an extensive computational study on large instances with up to 2000 jobs and 100 machines which show that the proposed heuristic is fast and yields in most cases schedules with relative deviation from a lower bound less than 0.2%.
URI: http://hdl.handle.net/123456789/13041
ISSN: 03050548
Appears in Collections:College of Engineering

Files in This Item:

File Description SizeFormat
7.doc43 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