Minimizing mean flow time with release time constraint (Q914352): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q601474 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Jian-Zhong Du / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing Mean Flow Time With Release Time and Deadline Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3339651 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3940839 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4194705 / rank | |||
Normal rank |
Latest revision as of 16:44, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimizing mean flow time with release time constraint |
scientific article |
Statements
Minimizing mean flow time with release time constraint (English)
0 references
1990
0 references
independent taks on m\(\geq 1\) identical processors
0 references
preemptive scheduling
0 references
NP-hard
0 references