SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS
2012 ◽
Vol 29
(04)
◽
pp. 1250019
◽
Keyword(s):
We address the nonresumable version of the scheduling problem with proportionally deteriorating jobs on a single machine subject to availability constraints. The objective is to minimize the total weighted completion time. We show that there exists no polynomial-time algorithm with a constant worst-case ratio for the problem with two nonavailability intervals unless [Formula: see text]. Furthermore, we propose a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme for the problem with a single nonavailability interval.
2013 ◽
Vol 423-426
◽
pp. 2224-2227
1983 ◽
Vol 2
(2)
◽
pp. 62-65
◽
2019 ◽
Vol 51
(11)
◽
pp. 1938-1943
◽
2016 ◽
Vol 33
(06)
◽
pp. 1650048
2017 ◽
Vol 34
(02)
◽
pp. 1750010
◽
2016 ◽
Vol 33
(05)
◽
pp. 1650034
◽
2005 ◽
Vol 16
(05)
◽
pp. 913-928
◽