Online scheduling with preemption or non-completion penalties (Q398912): 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/s10951-013-0321-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080390633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitiveness of on-line real-time task scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of Equal-Length Jobs on Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Hard Deadlines on Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of Bounded Length Jobs to Maximize Throughput / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on online deadline scheduling with preemption penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved on-line broadcast scheduling with deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admission control with immediate notification / 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: $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near Optimal Scheduler for On-Demand Data Broadcasts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Applications in Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Job Scheduling with Preemption Penalties / rank
 
Normal rank

Latest revision as of 22:36, 8 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling with preemption or non-completion penalties
scientific article

    Statements

    Online scheduling with preemption or non-completion penalties (English)
    0 references
    0 references
    18 August 2014
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references
    immediate notification
    0 references
    immediate decision
    0 references
    preemption penalty
    0 references

    Identifiers