Scheduling on a hypercube (Q1183498): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preemptive scheduling of independent jobs on a hypercube / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3619797 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP-complete scheduling problems / rank | |||
Normal rank |
Revision as of 15:48, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Scheduling on a hypercube |
scientific article |
Statements
Scheduling on a hypercube (English)
0 references
28 June 1992
0 references
scheduling
0 references
hypercube
0 references
0 references
0 references