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

Title: Extending the single machine-based relaxation scheme for the job shop scheduling problem
Authors: Gharbi, A
Labidi, M.
Keywords: Delayed Precedence Constraints; Delivery Times; Lower Bounds; Release Dates
Issue Date: 2010
Publisher: Elsevier Ltd.
Citation: Electronic Notes in Discrete Mathematics, 36 (C), pp. 1057-1064.
Abstract: The contribution of this paper to the job shop related literature is twofold. First, we provide an efficient way for solving the job shop scheduling problem with release dates, delivery times and delayed precedence constraints. It is shown that the latter problem is equivalent to a classical job shop with precedence constraints. Second, an effective extension of the standard single machine-based relaxation scheme is derived. Preliminary computational results conducted on a set of benchmark instances show that effective multiple machine-based lower bounds can be computed within reasonable CPU time.
URI: http://hdl.handle.net/123456789/13038
ISSN: 15710653
Appears in Collections:College of Engineering

Files in This Item:

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