Author/Authors :
Moslehi Ghasem نويسنده is a Professor of Department of Industrial Engineering,Isfahan, Iran , Shahandeh Nookabadi Ali نويسنده Department of Industrial and systems Engineering, Isfahan University of Tech., Iran, , Kianfar Kamran نويسنده Faculty of Engineering, University of Isfahan, Isfahan, Iran Kianfar Kamran
Abstract :
This paper addresses the Tardy/Lost penalty minimization with common due dates on
a single machine. According to this performance measure, if the tardiness of a job
exceeds a predefined value, the job will be lost and penalized by a fixed value.
Initially, we present a 2-approximation algorithm and examine its worst case ratio
bound. Then, a pseudo-polynomial dynamic programming algorithm is developed. We
show how to transform the dynamic programming algorithm to an FPTAS using the
technique of "structuring the execution of an algorithm" and examine the time
complexity of our FPTAS.
