The authors adapt aggregative, Pareto, and NSGA-II genetic algorithms to the tri-objective P2|fixj,rj|Cmax,ΣTj,ΣCj problem and propose lower bounds for each objective.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Multi-objective scheduling on two dedicated processors
The authors adapt aggregative, Pareto, and NSGA-II genetic algorithms to the tri-objective P2|fixj,rj|Cmax,ΣTj,ΣCj problem and propose lower bounds for each objective.