Back to Search
Start Over
Approximation Algorithms and an FPTAS for the Single Machine Problem with Biased Tardiness Penalty.
- Source :
-
Journal of Applied Mathematics . 2014, p1-10. 10p. - Publication Year :
- 2014
-
Abstract
- This paper addresses a new performance measure for scheduling problems, entitled "biased tardiness penalty." We study the approximability of minimum biased tardiness on a single machine, provided that all the due dates are equal. Two heuristic algorithms are developed for this problem, and it is shown that one of them has a worst-case ratio bound of 2. Then, we propose a dynamic programming algorithm and use it to design an FPTAS. The FPTAS is generated by cleaning up some states in the dynamic programming algorithm, and it requires O(n3/ε) time. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 1110757X
- Database :
- Academic Search Index
- Journal :
- Journal of Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 100493334
- Full Text :
- https://doi.org/10.1155/2014/679702