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)

There is a more recent version of this item available.

PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
343Kb

Official URL: http://www.springerlink.com/content/v861904127586367/fulltext.pdf

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)
ID Code:	190
Deposited By:	Kerem Bülbül
Deposited On:	20 Dec 2006 02:00
Last Modified:	24 Jun 2009 16:40

Available Versions of this Item

Preemption in single machine earliness-tardiness scheduling. (deposited 20 Dec 2006 02:00) [Currently Displayed]
- Preemption in single machine earliness/tardiness scheduling. (deposited 09 Oct 2007 23:51)

Repository Staff Only: item control page