An Optimal Algorithm for Scheduling with Variable Job Processing Times and Rejection
2015 ◽
Vol 775
◽
pp. 449-452
Keyword(s):
This paper studies a single machine scheduling problem with rejection. Each job has a variable processing time and a rejection penalty. The objective function is to minimize the sum of the makespan of the accepted jobs and the total rejection penalty of the rejected jobs. We show that the problem can be solved in polynomial time.
2013 ◽
Vol 787
◽
pp. 1020-1024
2002 ◽
Vol 19
(5)
◽
pp. 59-67
◽
Keyword(s):
2017 ◽
Vol 2017
◽
pp. 1-8
◽
Keyword(s):
2016 ◽
Vol 30
(2-3)
◽
pp. 292-304
◽
Keyword(s):
2020 ◽
Vol 790
◽
pp. 012093
◽
Keyword(s):