TY  - CHAP
AU  - Alexander A. Lazarev
AU  - Nikolay Pravdivets
ED  - Nodari Vakhania
ED  - Frank Werner
Y1  - 2020-11-02
PY  - 2020
T1  - Polynomial Algorithm for Constructing Pareto-Optimal Schedules for Problem 1∣<em>r</em><sub>j</sub>∣<em>L</em><sub>max</sub>,<em>C</em><sub>max</sub>
N2  - Multi-criteria optimization problems naturally arise in practice when there is no single criterion for measuring the quality of a feasible solution. Since different criteria are contradictory, it is difficult and often impossible to find a single feasible solution that is good for all the criteria. Hence, some compromise is needed. As such, this book examines the commonly accepted compromise of the traditional Pareto-optimality approach. It also proposes one new alternative approach for generating feasible solutions to multi-criteria optimization problems. Finally, the book presents two chapters on the existing solution methods for two real-life, multi-criteria optimization problems.
BT  - Multicriteria Optimization
SP  - Ch. 2
UR  - https://doi.org/10.5772/intechopen.93677
DO  - 10.5772/intechopen.93677
SN  - 978-1-78984-719-2
PB  - IntechOpen
CY  - Rijeka
Y2  - 2024-04-24
ER  -