Complexity of scheduling multiprocessor tasks with prespecified processors allocations (Q1343144): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks on three dedicated processors / 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 subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: The complexity of scheduling independent two-processor tasks on dedicated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor scheduling with communication delays / rank
 
Normal rank

Latest revision as of 10:38, 23 May 2024

scientific article
Language Label Description Also known as
English
Complexity of scheduling multiprocessor tasks with prespecified processors allocations
scientific article

    Statements

    Identifiers