Use este identificador para citar ou linkar para este item:
http://www.repositorio.ufop.br/jspui/handle/123456789/15686
Registro completo de metadados
Campo Dublin Core | Valor | Idioma |
---|---|---|
dc.contributor.author | Rego, Marcelo Ferreira | - |
dc.contributor.author | Pinto, Júlio César Evaristo Moreira | - |
dc.contributor.author | Cota, Luciano Perdigão | - |
dc.contributor.author | Souza, Marcone Jamilson Freitas | - |
dc.date.accessioned | 2022-10-13T20:36:31Z | - |
dc.date.available | 2022-10-13T20:36:31Z | - |
dc.date.issued | 2022 | pt_BR |
dc.identifier.citation | REGO, M. F. et al. 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. PEERJ Computer Science, v. 8, artigo e844, 2022. Disponível em: <https://peerj.com/articles/cs-844/>. Acesso em: 06 jul. 2022. | pt_BR |
dc.identifier.issn | 2376-5992 | - |
dc.identifier.uri | http://www.repositorio.ufop.br/jspui/handle/123456789/15686 | - |
dc.description.abstract | In 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. | pt_BR |
dc.language.iso | en_US | pt_BR |
dc.rights | aberto | pt_BR |
dc.subject | Total energy cost | pt_BR |
dc.subject | Mixed-integer linear programming | pt_BR |
dc.subject | Multi-objective optimization | pt_BR |
dc.title | 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. | pt_BR |
dc.type | Artigo publicado em periodico | pt_BR |
dc.rights.license | This article is distributed under Creative Commons CC-BY 4.0. Fonte: o PDF do artigo. | pt_BR |
dc.identifier.doi | https://doi.org/10.7717/peerj-cs.844 | pt_BR |
Aparece nas coleções: | DECOM - Artigos publicados em periódicos |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
ARTIGO_MathematicalFormulationNSGA.pdf | 2,13 MB | Adobe PDF | Visualizar/Abrir |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.