Q5009506 (Q5009506): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Zhi-Yi Huang / rank
Normal rank
 
Property / author
 
Property / author: Zhi-Yi Huang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total flow time and total completion time with immediate dispatching / rank
 
Normal rank
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: New lower and upper bounds for on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on identical machines: How good is LPT in an on-line setting? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help / 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: Preemptive online scheduling: Optimal algorithms for all speeds / 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: Q4252304 / 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: On-line scheduling revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling on a single machine: Maximizing the number of early jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Online Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Algorithm for an Ancient Scheduling Problem / 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: An optimal online algorithm for scheduling two machines with release times / 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 simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer / rank
 
Normal rank

Latest revision as of 07:47, 26 July 2024

scientific article; zbMATH DE number 7378626
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7378626

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2021
    0 references
    online scheduling
    0 references
    makespan minimization
    0 references
    identical machines
    0 references
    0 references

    Identifiers