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

Title: Jackson's semi-preemptive scheduling on a single machine
Authors: Gharbi, A
Labidi, M
Keywords: Adjustment procedures; Branch-and-bound; Delivery times; Lower bound; Makespan; Release dates; Semi-preemptive scheduling; Single machine
Issue Date: 2010
Publisher: Elsevier Ltd.
Citation: Computers and Operations Research, 37 (12), pp. 2082-2088.
Abstract: We propose an effective improvement of the well-known Jackson's preemptive schedule lower bound for the single machine scheduling problem with heads and tails. The semi-preemptive scheduling concept roughly consists in reducing the preemption impact by constraining some particular job parts to be processed in reduced time intervals. The impact of semi-preemptive scheduling is twofold: it yields a lower bound which dominates the preemptive one, and enables more effective adjustments of the heads and tails. Our experimental study revealed that suitably embedding our procedure within Carlier's algorithm makes feasible to solve all of the hard instances which could not be solved by its original variant.
URI: http://hdl.handle.net/123456789/13035
ISSN: 03050548
Appears in Collections:College of Engineering

Files in This Item:

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