Rejecting jobs to minimize load and maximum flow-time (Q2409575): 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.1016/j.jcss.2017.07.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2751469631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling to minimize Max flow time: an optimal preemptive algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line routing of virtual circuits with applications to load balancing and machine 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: Q4230343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Competitiveness of On-Line Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Server scheduling in the L <sub>p</sub> norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Rejection / 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: Fair online load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust maximum completion time measure for scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-processor scheduling to minimize flow time with ε resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive online scheduling with rejection of unit jobs on two uniformly related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Algorithms for Minimizing Average Flow-Time on Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Norms and All-L_p-Norms Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Outliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating total flow time on parallel machines / rank
 
Normal rank

Latest revision as of 12:44, 14 July 2024

scientific article
Language Label Description Also known as
English
Rejecting jobs to minimize load and maximum flow-time
scientific article

    Statements

    Rejecting jobs to minimize load and maximum flow-time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 October 2017
    0 references
    online job scheduling
    0 references
    restricted assignment
    0 references
    flow-time
    0 references
    rejection model
    0 references
    competitive ratio
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers