Online scheduling with one rearrangement at the end: revisited (Q456073): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1765935
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yu-Xin Wang / rank
 
Normal rank
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.ipl.2012.05.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094285533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for online scheduling with bounded rearrangement at the end / 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: 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: 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:01, 5 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling with one rearrangement at the end: revisited
scientific article

    Statements

    Online scheduling with one rearrangement at the end: revisited (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling problems
    0 references
    competitive ratio
    0 references
    online algorithms
    0 references
    0 references