A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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 generaldoi:10.1155/2020/9746538 fatcat:ungiqwnzyfb5rpz3xep7yzikci