A mathematical formulation and an NSGA-II algorithm for minimizing the makespan and energy cost under time-of-use electricity price in an unrelated parallel machine scheduling.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorRego, Marcelo Ferreira-
Autor(es): dc.creatorPinto, Júlio César Evaristo Moreira-
Autor(es): dc.creatorCota, Luciano Perdigão-
Autor(es): dc.creatorSouza, Marcone Jamilson Freitas-
Data de aceite: dc.date.accessioned2025-08-21T15:36:15Z-
Data de disponibilização: dc.date.available2025-08-21T15:36:15Z-
Data de envio: dc.date.issued2022-10-13-
Data de envio: dc.date.issued2022-10-13-
Data de envio: dc.date.issued2021-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/jspui/handle/123456789/15686-
Fonte completa do material: dc.identifierhttps://doi.org/10.7717/peerj-cs.844-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1019505-
Descrição: dc.descriptionIn many countries, there is an energy pricing policy that varies according to the time-of-use. In this context, it is financially advantageous for the industries to plan their production considering this policy. This article introduces a new bi-objective unrelated parallel machine scheduling problem with sequence-dependent setup times, in which the objectives are to minimize the makespan and the total energy cost. We propose a mixed-integer linear programming formulation based on the weighted sum method to obtain the Pareto front. We also developed an NSGA-II method to address large instances of the problem since the formulation cannot solve it in an acceptable computational time for decision-making. The results showed that the proposed NSGA-II is able to find a good approximation for the Pareto front when compared with the weighted sum method in small instances. In a large number of instances, NSGA-II outperforms, with a 95% confidence level, the MOGA and NSGA-I multi-objective techniques concerning the hypervolume and hierarchical cluster counting metrics. Thus, the proposed algorithm finds non-dominated solutions with good convergence, diversity, uniformity, and amplitude.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsaberto-
Direitos: dc.rightsThis article is distributed under Creative Commons CC-BY 4.0. Fonte: o PDF do artigo.-
Palavras-chave: dc.subjectTotal energy cost-
Palavras-chave: dc.subjectMixed-integer linear programming-
Palavras-chave: dc.subjectMulti-objective optimization-
Título: dc.titleA mathematical formulation and an NSGA-II algorithm for minimizing the makespan and energy cost under time-of-use electricity price in an unrelated parallel machine scheduling.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.