Best Possible Approximation Algorithms for Single Machine Scheduling with Increasing Linear Maintenance Durations
Keyword(s):
We consider a single machine scheduling problem with multiple maintenance activities, where the maintenance duration function is of the linear formft=a+btwitha≥0andb>1. We propose an approximation algorithm named FFD-LS2I with a worst-case bound of 2 for problem. We also show that there is no polynomial time approximation algorithm with a worst-case bound less than 2 for the problem withb≥0unlessP=NP, which implies that the FFD-LS2I algorithm is the best possible algorithm for the caseb>1and that the FFD-LS algorithm, which is proposed in the literature, is the best possible algorithm for the caseb≤1both from the worst-case bound point of view.
2013 ◽
Vol 30
(01)
◽
pp. 1250048
◽
2000 ◽
Vol 26
(4)
◽
pp. 149-154
◽
1994 ◽
Vol 48
(1)
◽
pp. 69-79
◽
2012 ◽
Vol 2
(2)
◽
pp. 673-680
◽
2010 ◽
Vol 215
(11)
◽
pp. 3929-3935
◽