Optimization for due-window assignment scheduling with position-dependent weights (Q2195512): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q552329 |
Changed an Item |
||
| Property / author | |||
| Property / author: Li-Yan Wang / rank | |||
Normal rank | |||
Revision as of 12:02, 17 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimization for due-window assignment scheduling with position-dependent weights |
scientific article |
Statements
Optimization for due-window assignment scheduling with position-dependent weights (English)
0 references
26 August 2020
0 references
Summary: 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.
0 references
