Optimization for Due-Window Assignment Scheduling with Position-Dependent Weights

الملخص EN

This paper considers a single-machine due-window assignment scheduling problem with position-dependent weights, where the weights only depend on their position in a sequence.

The objective is to minimise the total weighted penalty of earliness, tardiness, due-window starting time, and due-window size of all jobs.

Optimal properties of the problem are given, and then, a polynomial-time algorithm is provided to solve the problem.

An extension to the problem is offered by assuming general position-dependent processing time.