A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Study on Single-Machine Group Scheduling with Due-Window Assignment and Position-Dependent Weights
Mathematical Problems in Engineering
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 solveddoi:10.1155/2021/2232696 doaj:87b9464c76ab47479a6588acf5255ea4 fatcat:a6av6wkusffx7del7ys5pj2zsu