Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10659
Title: Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
Authors: Tian, Z
Ng, CT 
Cheng, TCE 
Keywords: Preemptive scheduling
Single machine
Total tardiness
Issue Date: 2009
Publisher: North-Holland
Source: Operations research letters, 2009, v. 37, no. 5, p. 368-374 How to cite?
Journal: Operations research letters 
Abstract: We consider the problem of scheduling n preemptive jobs on a single machine to minimize total tardiness, subject to agreeable due dates, i.e., a later release date corresponds to a later due date. We prove that the problem is N P-hard in the ordinary sense by showing that it is N P-hard, and deriving a pseudo-polynomial algorithm for it.
URI: http://hdl.handle.net/10397/10659
ISSN: 0167-6377
EISSN: 1872-7468
DOI: 10.1016/j.orl.2009.04.004
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Aug 18, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Aug 16, 2017

Page view(s)

49
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



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