Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22748
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 
Keywords: Equal-length jobs
Preemptive scheduling
Release date
Single machine
Total tardiness
Issue Date: 2006
Publisher: Springer
Source: Journal of scheduling, 2006, v. 9, no. 4, p. 343-364 How to cite?
Journal: Journal of scheduling 
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.
URI: http://hdl.handle.net/10397/22748
ISSN: 1094-6136
EISSN: 1099-1425
DOI: 10.1007/s10965-006-9049-7
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

10
Last Week
0
Last month
0
Citations as of Jul 20, 2017

WEB OF SCIENCETM
Citations

7
Last Week
0
Last month
0
Citations as of Jul 15, 2017

Page view(s)

58
Last Week
1
Last month
Checked on Jul 16, 2017

Google ScholarTM

Check

Altmetric



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