Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine (Q474786)

Summary: 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 in \(O(n^{4})\) time. For some important special cases, the time complexity can be improved to be \(O(n^{2})\) using dynamic programming techniques.