Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q63353562, #quickstatements; #temporary_batch_1707252663060
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Online scheduling with a buffer on related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Online Scheduling with Reordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with rearrangement on two related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Reordering for Online Minimum Makespan Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line algorithms for the partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on two uniform machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Bounded Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with reassignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer / rank
 
Normal rank

Latest revision as of 20:13, 4 July 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