Single Machine Due Date Assignment Scheduling with Deterioration and Learning Effect

Abstract

In this study, we consider single machine due date assignment scheduling problems with deterioration and learning effect. Under the common (CON) due date assignment method (and the slack (SLK) due date assignment method) and position-dependent weights, we prove that the weighted sum of the absolute value in lateness and a due date minimization can be solved in polynomial time.