Open AccessThe Pareto set reduction in bicriteria customer order scheduling on a single machine with setup times
Author(s) -
Yulia V. Kovalenko,
Aleksey O. Zakharov
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1546/1/012087
Subject(s) - pareto principle , mathematical optimization , computer science , set (abstract data type) , pareto analysis , reduction (mathematics) , scheduling (production processes) , pareto optimal , axiom , context (archaeology) , multi objective optimization , mathematics , geometry , programming language , paleontology , biology
A bicriteria customer order scheduling problem is investigated in the context of the axiomatic approach of the Pareto set reduction proposed by V. Noghin. We construct families of the instances with various structures of the Pareto set and theoretically analyze the Pareto set reduction.