Open Access
Translator Disclaimer
2014 Approximation Algorithms and an FPTAS for the Single Machine Problem with Biased Tardiness Penalty
G. Moslehi, K. Kianfar
J. Appl. Math. 2014: 1-10 (2014). DOI: 10.1155/2014/679702

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 On3/ε time.

Citation

Download Citation

G. Moslehi. K. Kianfar. "Approximation Algorithms and an FPTAS for the Single Machine Problem with Biased Tardiness Penalty." J. Appl. Math. 2014 1 - 10, 2014. https://doi.org/10.1155/2014/679702

Information

Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07131782
Digital Object Identifier: 10.1155/2014/679702

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
10 PAGES


SHARE
Vol.2014 • 2014
Back to Top