Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/30640
Title: An O(n 2 ) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
Authors: Tian, Z
Ng, CT 
Cheng, TCE 
Issue Date: 2006
Source: Journal of scheduling, 2006, v. 9, no. 4, p. 343-364
Abstract: In this paper, we study the problem of scheduling n equal-length preemptive jobs on a single machine to minimize total tardiness, subject to release dates. The complexity status of this problem has remained open to date. We provide an O(n 2) time algorithm to solve the problem.
Keywords: Single machine
Preemptive scheduling
Release date
Equal-length jobs
Total tardiness
Publisher: Springer
Journal: Journal of scheduling 
ISSN: 1094-6136
EISSN: 1099-1425
DOI: 10.1007/s10951-006-7039-6
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

14
Last Week
0
Last month
Citations as of Aug 28, 2020

WEB OF SCIENCETM
Citations

10
Last Week
0
Last month
0
Citations as of Sep 18, 2020

Page view(s)

216
Last Week
0
Last month
Citations as of Sep 21, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.