English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This paper explores the characteristics of solutions when scheduling jobs in a shop with parallel machines. Three classical objective functions were considered: makespan, total completion time, and total tardiness. These three criteria were combined in pairs, resulting in three bi-objective formulations. These formulations were solved using the ε-constraint method to obtain a Pareto frontier for each pair. The objective of the research is to evaluate the Pareto set of efficient schedules to characterize the solution sets. The characterization of the solutions sets is based on two performance metrics: the span of the objective functions' values for the points in the frontier and their closeness to the ideal point. Results that consider four experimental factors indicate that when the makespan is one of the objective functions, the range of the processing times among jobs has a significant influence on the characteristics of the Pareto frontier. Simultaneously, the slack of due dates is the most relevant factor when total tardiness is considered.

Scheduling in parallel machines with two objectives: analysis of factors that influence the Pareto frontier