SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN
2010 ◽
Vol 27
(04)
◽
pp. 493-501
Keyword(s):
In this paper, we address the scheduling model with discretely compressible release dates, where processing any job with a compressed release date incurs a corresponding compression cost. We consider the following problem for the first time: scheduling with discretely compressible release dates to minimize the sum of makespan plus total compression cost. We show its NP-hardness, and design an approximation algorithm with worst-case performance ratio 2, which is the best possible if the processing order of the jobs is pre-specified.
2010 ◽
Vol 23
(4)
◽
pp. 2198-2203
◽
1999 ◽
Vol Vol. 3 no. 4
◽
2003 ◽
Vol 31
(1)
◽
pp. 35-41
◽
2005 ◽
Vol 22
(04)
◽
pp. 445-462
◽
2008 ◽
Vol 25
(01)
◽
pp. 1-10
◽
1993 ◽
Vol 14
(2)
◽
pp. 117-124
◽