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

Title: Minimizing makespan on parallel machines subject to release dates and delivery times
Authors: Gharbi, A.,
Haouari, M.
Keywords: Branch-and-bound; Delivery times; Identical parallel machines; Makespan; Release dates; Scheduling
Issue Date: 2002
Publisher: John Wiley & Sons, Ltd.
Citation: Journal of Scheduling, 5 (4), pp. 329-355.
Abstract: We consider the problem of minimizing the makespan on identical parallel machines subject to release dates and delivery times. The objective of this paper is to develop exact branch-and-bound algorithms to solve this strongly NP-hard problem. A preprocessing algorithm is devised to speed up the convergence of the proposed algorithms, and a new tight bounding scheme is introduced. The search tree is also reduced using a polynomial selection algorithm. Extensive computational experiments show that instances with up to 300 jobs can be solved exactly in a moderate CPU time. Copyright
URI: http://hdl.handle.net/123456789/13153
ISSN: 10946136
Appears in Collections:College of Engineering

Files in This Item:

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