Preemptive online algorithms for scheduling with machine cost (Q1777224): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00236-004-0156-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092031801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for preemptive on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Online Algorithms for Scheduling with Machine Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online algorithms for parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin stretching revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with machine cost. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line scheduling on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941834 / 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: A guessing game and randomized online algorithms / rank
 
Normal rank

Latest revision as of 11:27, 10 June 2024

scientific article
Language Label Description Also known as
English
Preemptive online algorithms for scheduling with machine cost
scientific article

    Statements