Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22207
Title: On the single machine total tardiness problem
Authors: Tian, ZJ
Ng, CT 
Cheng, TCE 
Keywords: Scheduling
Single machine
Total tardiness
Issue Date: 2005
Publisher: Elsevier
Source: European journal of operational research, 2005, v. 165, no. 3, p. 843-846 How to cite?
Journal: European journal of operational research 
Abstract: In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates.
URI: http://hdl.handle.net/10397/22207
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/j.ejor.2004.03.017
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

9
Last Week
0
Last month
0
Citations as of Aug 12, 2017

WEB OF SCIENCETM
Citations

6
Last Week
0
Last month
0
Citations as of Aug 12, 2017

Page view(s)

43
Last Week
1
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.