A nonidentical parallel processor scheduling problem (Q3783824): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
label / en | label / en | ||
A nonidentical parallel processor scheduling problem | |||
Property / cites work | |||
Property / cites work: Q3957935 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bin packing problems in one dimension: Heuristic solutions and confidence intervals / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/1520-6750(198806)35:3<419::aid-nav3220350310>3.0.co;2-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2091680982 / rank | |||
Normal rank | |||
Property / title | |||
A nonidentical parallel processor scheduling problem (English) | |||
Property / title: A nonidentical parallel processor scheduling problem (English) / rank | |||
Normal rank |
Latest revision as of 11:41, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A nonidentical parallel processor scheduling problem |
scientific article |
Statements
1988
0 references
makespan
0 references
schedule length
0 references
parallel processors
0 references
heuristic
0 references
first fit decreasing bin-packing approximation
0 references
A nonidentical parallel processor scheduling problem (English)
0 references