Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (Q1761994): 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.1016/j.cor.2011.05.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2163689386 / rank
 
Normal rank

Revision as of 03:04, 20 March 2024

scientific article
Language Label Description Also known as
English
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
scientific article

    Statements

    Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates (English)
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    single machine
    0 references
    release dates
    0 references
    lower bounds
    0 references
    splitting
    0 references
    total weighted completion time
    0 references
    0 references