Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/13483
Title: An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
Institution and School/Department of submitter: Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών
Keywords: scheduling,approximation algorithms,tardiness,fptas,single-machine,approximation scheme,algorithms
URI: https://olympias.lib.uoi.gr/jspui/handle/123456789/13483
ISSN: 1549-6325
Link: <Go to ISI>://000309426300008
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
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ

Files in This Item:
File Description SizeFormat 
Karakostas-2012-An FPTAS for the Min.pdf157.38 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons