NP-complete scheduling problems (Q1220386): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4138187 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4066569 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal scheduling for two-processor systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Sequencing of Two Equivalent Processors / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:23, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | NP-complete scheduling problems |
scientific article |
Statements
NP-complete scheduling problems (English)
0 references
1975
0 references