Study on Single-Machine Group Scheduling with Due-Window Assignment and Position-Dependent Weights

Abstract

This article considers a single-machine group scheduling problem with due-window assignment, where the jobs are classified into groups and the jobs in the same group must be processed in succession. The goal is to minimize the weighted sum of lateness and due-window assignment cost, where the weights depend on the position in which a job is scheduled (i.e., position-dependent weights). For the common, slack, and different due-window assignment methods, we prove that the problem can be solved polynomially, i.e., in $O\left(N\log N\right)$ time, where $N$ is the number of jobs.