An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates

dc.contributor.authorKarakostas, G.en
dc.contributor.authorKolliopoulos, S. G.en
dc.contributor.authorWang, J.en
dc.date.accessioned2015-11-24T17:27:59Z
dc.date.available2015-11-24T17:27:59Z
dc.identifier.issn1549-6325-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/13483
dc.rightsDefault Licence-
dc.subjectschedulingen
dc.subjectapproximation algorithmsen
dc.subjecttardinessen
dc.subjectfptasen
dc.subjectsingle-machineen
dc.subjectapproximation schemeen
dc.subjectalgorithmsen
dc.titleAn FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Datesen
heal.abstractGiven a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its due date. We present an FPTAS for the basic scheduling problem of minimizing the total weighted tardiness when the number of distinct due dates is fixed. Previously, an FPTAS was known only for the case where all jobs have a common due date.en
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.identifier.primaryDoi 10.1145/2344422.2344430-
heal.identifier.secondary<Go to ISI>://000309426300008-
heal.identifier.secondaryhttp://delivery.acm.org/10.1145/2350000/2344430/a40-karakostas.pdf?ip=195.251.197.109&id=2344430&acc=ACTIVE%20SERVICE&key=C2716FEBFA981EF1E9B06A0954DB6E6FB2E80188D446F61C&CFID=286340637&CFTOKEN=12197681&__acm__=1390819494_356533509544fd50c80ecd77b3494fe5-
heal.journalNameAcm Transactions on Algorithmsen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2012-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικώνel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Φόρτωση...
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή: