A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations (Q337079): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C29 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6650687 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
project scheduling | |||
Property / zbMATH Keywords: project scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
discrete time-cost-quality trade-off | |||
Property / zbMATH Keywords: discrete time-cost-quality trade-off / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
mode identity | |||
Property / zbMATH Keywords: mode identity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
resource-constrained | |||
Property / zbMATH Keywords: resource-constrained / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
moica | |||
Property / zbMATH Keywords: moica / rank | |||
Normal rank |
Revision as of 05:21, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations |
scientific article |
Statements
A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations (English)
0 references
10 November 2016
0 references
project scheduling
0 references
discrete time-cost-quality trade-off
0 references
mode identity
0 references
resource-constrained
0 references
moica
0 references