Preemption in single machine earliness-tardiness scheduling

Bülbül, Kerem and Kaminsky, Philip and Yano, Candace (2006) Preemption in single machine earliness-tardiness scheduling. (Accepted/In Press)

Warning
There is a more recent version of this item available.
[thumbnail of 3011800000581.pdf] PDF
3011800000581.pdf
Restricted to Registered users only

Download (351kB) | Request a copy

Abstract

We consider a single machine earliness/tardiness scheduling problem with general weights, ready times and due dates. Our solution approach is based on a time-indexed preemptive relaxation of the problem. For the objective function of this relaxation, we characterize cost coe±cients that are the best among those with a piecewise linear structure with two segments. From the solution to the relaxation with these best objective function coe±cients, we generate feasible solutions for the original non-preemptive problem. We report extensive computational results demonstrating the speed and effectiveness of this approach.
Item Type: Article
Uncontrolled Keywords: Single-machine scheduling, Earliness, Tardiness; Preemption; Transportation problem.
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Kerem Bülbül
Date Deposited: 20 Dec 2006 02:00
Last Modified: 24 Jun 2009 16:40
URI: https://research.sabanciuniv.edu/id/eprint/190

Available Versions of this Item

Actions (login required)

View Item
View Item