Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127358836, #quickstatements; #temporary_batch_1722371031483
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: New algorithms for an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing for Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for randomized on-line scheduling algorithms / 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: Randomized on-line scheduling on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for on-line scheduling on uniformly related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Level Algorithm for Preemptive Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for randomized on-line multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling uniform machines on-line requires nondecreasing speed ratios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive on-line scheduling for two uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comment on scheduling on uniform machines under chain-type precedence constraints / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-6377(01)00085-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071788993 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127358836 / rank
 
Normal rank

Latest revision as of 22:43, 30 July 2024

scientific article; zbMATH DE number 1678877
Language Label Description Also known as
English
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
scientific article; zbMATH DE number 1678877

    Statements

    Identifiers