Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine
2013 ◽
Vol 2013
◽
pp. 1-9
◽
Keyword(s):
We consider single machine scheduling problems with learning/deterioration effects and time-dependent processing times, with due date assignment consideration, and our objective is to minimize the weighted number of tardy jobs. By reducing all versions of the problem to an assignment problem, we solve them inO(n4) time. For some important special cases, the time complexity can be improved to beO(n2) using dynamic programming techniques.
2014 ◽
Vol 624
◽
pp. 675-680
2021 ◽
Vol 16
(2)
◽
pp. 154
2014 ◽
Vol 248
◽
pp. 503-510
◽
2021 ◽
Vol 16
(2)
◽
pp. 154
2015 ◽
Vol 32
(06)
◽
pp. 1550045
◽
Keyword(s):
2003 ◽
pp. 211-216
◽
Keyword(s):
2014 ◽
Vol 10
(1)
◽
pp. 219-241
◽
Keyword(s):
2016 ◽
Vol 33
(1)
◽
pp. 239-249
◽