On the complexity of adjacent resource scheduling (Q880528): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling independent multiprocessor tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks on three dedicated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks -- An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling Parallel Task Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of scheduling multiprocessor tasks with prespecified processors allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of scheduling independent two-processor tasks on dedicated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional packing problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485395 / rank
 
Normal rank

Latest revision as of 18:08, 25 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of adjacent resource scheduling
scientific article

    Statements

    Identifiers