Research Article
Approximation Algorithms and an FPTAS for the Single Machine Problem with Biased Tardiness Penalty
Algorithm 2
FPTAS algorithm.
(1) For each | (1.1) Set | (1.2) For each | (i) Consider every state in | (a) If then add to | (b) If then add to | (ii) Delete the state space | (iii) Let be a state in such that with the smallest (break ties | by choosing the state of the smallest ). Set | (1.3) Set | (2) Calculate the final solution of FPTAS from |
|