Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317): 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.tcs.2011.07.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016068554 / rank
 
Normal rank

Revision as of 00:02, 20 March 2024

scientific article
Language Label Description Also known as
English
Optimal algorithms for online scheduling with bounded rearrangement at the end
scientific article

    Statements

    Optimal algorithms for online scheduling with bounded rearrangement at the end (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    online scheduling
    0 references
    lower bounds
    0 references
    upper bounds
    0 references
    online scheduling with bounded rearrangement at the end (BRE)
    0 references
    0 references
    0 references