Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/30640
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorTian, Z-
dc.creatorNg, CT-
dc.creatorCheng, TCE-
dc.date.accessioned2015-08-28T04:29:02Z-
dc.date.available2015-08-28T04:29:02Z-
dc.identifier.issn1094-6136-
dc.identifier.urihttp://hdl.handle.net/10397/30640-
dc.language.isoen-
dc.publisherSpringer-
dc.subjectSingle machine-
dc.subjectPreemptive scheduling-
dc.subjectRelease date-
dc.subjectEqual-length jobs-
dc.subjectTotal tardiness-
dc.titleAn O(n 2 ) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness-
dc.typeJournal/Magazine Article-
dc.identifier.spage343-
dc.identifier.epage364-
dc.identifier.volume9-
dc.identifier.issue4-
dc.identifier.doi10.1007/s10951-006-7039-6-
dcterms.abstractIn 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.-
dcterms.bibliographicCitationJournal of scheduling, 2006, v. 9, no. 4, p. 343-364-
dcterms.isPartOfJournal of scheduling-
dcterms.issued2006-
dc.identifier.isiWOS:000237503900002-
dc.identifier.scopus2-s2.0-33646678231-
dc.identifier.eissn1099-1425-
dc.identifier.rosgroupidr25726-
dc.description.ros2005-2006 > Academic research: refereed > Publication in refereed journal-
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple 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 Oct 28, 2020

Page view(s)

217
Last Week
0
Last month
Citations as of Oct 26, 2020

Google ScholarTM

Check

Altmetric


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