Hierarchies for classes of priority algorithms for job scheduling (Q818127): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.tcs.2005.10.045 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999518031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority algorithms for makespan minimization in the subset model. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:28, 24 June 2024

scientific article
Language Label Description Also known as
English
Hierarchies for classes of priority algorithms for job scheduling
scientific article

    Statements

    Hierarchies for classes of priority algorithms for job scheduling (English)
    0 references
    24 March 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    greedy algorithm
    0 references
    classes
    0 references
    algorithmic paradigms
    0 references
    0 references