TY - JOUR
T1 - Fast approximation algorithm for job sequencing with deadlines
AU - Gens, G. V.
AU - Levner, E. V.
PY - 1981/11
Y1 - 1981/11
N2 - The problem under consideration is to schedule jobs on a machine in order to minimize the sum of the penalties of delayed jobs. A "range-and-bound" method is proposed for finding a tight bound P̃ such that P̃≤P*≤2P̃, P* being the minimal sum desired. The considered scheduling problem, for n jobs and accuracy ε > 0, is solved by a fully polynomial ε-approximation algorithm in O(n2log n + n2 ε) time and O( n2 ε) space.
AB - The problem under consideration is to schedule jobs on a machine in order to minimize the sum of the penalties of delayed jobs. A "range-and-bound" method is proposed for finding a tight bound P̃ such that P̃≤P*≤2P̃, P* being the minimal sum desired. The considered scheduling problem, for n jobs and accuracy ε > 0, is solved by a fully polynomial ε-approximation algorithm in O(n2log n + n2 ε) time and O( n2 ε) space.
UR - http://www.scopus.com/inward/record.url?scp=0019633768&partnerID=8YFLogxK
U2 - 10.1016/0166-218x(81)90008-1
DO - 10.1016/0166-218x(81)90008-1
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0019633768
SN - 0166-218X
VL - 3
SP - 313
EP - 318
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 4
ER -