This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2026-232288
If you've NEVER registered a DOI in your Lattes, check our tutorial!This work studies the unrelated parallel machine scheduling problem from a multi-objective perspective. A Constraint Programming model and the ε-constraint method were employed to extract the Pareto Front. The CP-SAT approach demonstrated better computational performance over Mixed Integer Linear Programming regarding solution quality. In a computational experiment with 33 instances, the CP model achieved an average gap of 51.99% whereas the MILP closed with an average gap of 58.32%, a reduction proven to be statistically significant by the paired Student's t-test. After verifying the strong performance of CP-SAT compared to MILP, the complete resolution of the multi-objective problem was conducted for one of the instances. The resulting frontier revealed three non-dominated solutions, which were evaluated using the Hypervolume indicator. Solution 3 was chosen as the most suitable, reflecting the high priority assigned to tardiness reduction within the evaluated scenario.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper