Common due window assignment and single machine scheduling with delivery time, resource allocation, and job-dependent learning effect

Abstract

A single machine scheduling problem takes into account a common due window assignment, including delivery time, resource allocation and learning effect. The basic processing time, position and allotted resources are all linked to the actual processing time. We take into consideration three goal functions, which minimize the costs of earliness, tardiness, start time of window, window size, resource allocation and makespan. The aim is to find the optimal sequence and distribution of resources. Polynomial time algorithms are provided for each of the three issues. The algorithms have \(O(n^3)\) levels of complexity, where n is the number of jobs. Special cases with the same learning rates are also considered. Polynomial time algorithms are also provided for each of the special cases. The algorithms have \(O(n\textrm{log}n)\) levels of complexity.