RT - Journal Article
T1 - Minimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs
JF - IUST
YR - 2017
JO - IUST
VO - 28
IS - 3
UR - http://ijiepr.iust.ac.ir/article-1-710-en.html
SP - 221
EP - 240
K1 - Single machine scheduling
K1 - Tardy/Lost penalty
K1 - Dynamic programming
K1 - Approximation algorithm
K1 - FPTAS
AB - This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with rejection and hence, the results of this study are applicable for them. Initially, we present two approximation algorithms. Then, two special cases of the main problem are considered. In the first case, all jobs have the same tardiness weights where an FPTAS is developed using the technique of “structuring the execution of an algorithm". The second special case occurs when none of the jobs can be early. For this case, a 2-approximation algorithm is developed as well as a dynamic programming algorithm which is converted to an FPTAS.
LA eng
UL http://ijiepr.iust.ac.ir/article-1-710-en.html
M3 10.22068/ijiepr.28.3.221
ER -