Online interval scheduling on a single machine with finite lookahead (Q339562): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1288472
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2012.06.003 / rank
Normal rank
 
Property / author
 
Property / author: Yin-Feng Xu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2012.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999560225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed interval scheduling: models, applications, computational complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / 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: Bounding the Power of Preemption in Randomized Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized online interval scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Randomized Results for That Interval Selection Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A look-ahead heuristic for scheduling jobs with release dates on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit length jobs on parallel machines with lookahead information / rank
 
Normal rank
Property / cites work
 
Property / cites work: How much can lookahead help in online single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2012.06.003 / rank
 
Normal rank

Latest revision as of 14:48, 9 December 2024

scientific article
Language Label Description Also known as
English
Online interval scheduling on a single machine with finite lookahead
scientific article

    Statements

    Online interval scheduling on a single machine with finite lookahead (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 November 2016
    0 references
    online interval scheduling
    0 references
    lookahead
    0 references
    preemption
    0 references
    competitive ratio
    0 references

    Identifiers