Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect

Abstract

<p style='text-indent:20px;'>This paper considers single-machine position-dependent weights scheduling problem with past-sequence-dependent delivery times and truncated sum-of-processing-times-based learning effect. The objective is to minimize the weighted sum of due date, and the number of early jobs and tardy jobs, where the weights are position-dependent weights. Under the common due date, slack due date and different due date assignments, the optimal properties are given, and the corresponding optimal solution algorithms are respectively proposed to obtain the optimal sequence and optimal due dates of jobs.</p>