Optimization for due-window assignment scheduling with position-dependent weights (Q2195512): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2020/9746538 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3044856877 / rank
 
Normal rank

Latest revision as of 02:42, 20 March 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
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references