Competitive analysis of preemptive single-machine scheduling (Q614049): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
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.orl.2010.08.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977040436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing PTASs for MIN-SUM scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-based online scheduling: From single to parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coping with Incomplete Information in Scheduling — Stochastic and Online Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of \(\alpha\)-points in preemptive single machine scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Average Completion Time Scheduling / rank
 
Normal rank

Latest revision as of 14:56, 3 July 2024

scientific article
Language Label Description Also known as
English
Competitive analysis of preemptive single-machine scheduling
scientific article

    Statements