Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13483Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Karakostas, G. | en |
| dc.contributor.author | Kolliopoulos, S. G. | en |
| dc.contributor.author | Wang, J. | en |
| dc.date.accessioned | 2015-11-24T17:27:59Z | - |
| dc.date.available | 2015-11-24T17:27:59Z | - |
| dc.identifier.issn | 1549-6325 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13483 | - |
| dc.rights | Default Licence | - |
| dc.subject | scheduling | en |
| dc.subject | approximation algorithms | en |
| dc.subject | tardiness | en |
| dc.subject | fptas | en |
| dc.subject | single-machine | en |
| dc.subject | approximation scheme | en |
| dc.subject | algorithms | en |
| dc.title | An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | Doi 10.1145/2344422.2344430 | - |
| heal.identifier.secondary | <Go to ISI>://000309426300008 | - |
| heal.identifier.secondary | http://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.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2012 | - |
| heal.abstract | Given 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.journalName | Acm Transactions on Algorithms | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Karakostas-2012-An FPTAS for the Min.pdf | 157.38 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
