Study on critical operations in job shop scheduling in productive systems
Autor(a) principal: | |
---|---|
Data de Publicação: | 2022 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | por |
Título da fonte: | Research, Society and Development |
Texto Completo: | https://rsdjournal.org/index.php/rsd/article/view/28035 |
Resumo: | This work studies the classic problem of job shop scheduling for makespan minimizing. Due to the combinatorial nature and computational complexity of this problem, the use of metaheuristic techniques combined with local search methods is quite widespread as it allows satisfactory results in a viable computational time. In general, local search methods are based on empirical permutations of the operations that make up the critical path of a solution, the so-called critical operations, which demand the calculation of the critical path for each of the solutions generated in the search process. In addition to increasing the computational cost of local search, this approach promotes permutations of operations that do not result in any improvement in the solution. This work investigates the distribution of critical operations on the machines and the correlation between this distribution and problem characteristics. The objective is to estimate machines that concentrate critical operations and identify characteristics that contribute to the definition of local search methods that do not depend on the calculation of the critical path for each solution. Computational experiments with usual instances from literature show that there is a concentration of critical operations in some machines and, in some cases, a positive correlation between this concentration and the average processing times of the operations, which can provide subsidies for creating more efficient local search methods. |
id |
UNIFEI_fb3df015c9f2a82a30a11fd44e7c813e |
---|---|
oai_identifier_str |
oai:ojs.pkp.sfu.ca:article/28035 |
network_acronym_str |
UNIFEI |
network_name_str |
Research, Society and Development |
repository_id_str |
|
spelling |
Study on critical operations in job shop scheduling in productive systems Estudio sobre operaciones críticas en las tareas de programación en sistemas productivos de tipo job shopEstudo sobre as operações críticas no agendamento de tarefas em sistemas produtivos do tipo job shopBusca localCaminho CríticoSchedulingManufaturaPlanejamento do processo.Búsqueda de ubicaciónRuta críticaProgramaciónFabricaciónPlanificación de processos.Local searchCritical pathSchedulingManufacturingProcess plan.This work studies the classic problem of job shop scheduling for makespan minimizing. Due to the combinatorial nature and computational complexity of this problem, the use of metaheuristic techniques combined with local search methods is quite widespread as it allows satisfactory results in a viable computational time. In general, local search methods are based on empirical permutations of the operations that make up the critical path of a solution, the so-called critical operations, which demand the calculation of the critical path for each of the solutions generated in the search process. In addition to increasing the computational cost of local search, this approach promotes permutations of operations that do not result in any improvement in the solution. This work investigates the distribution of critical operations on the machines and the correlation between this distribution and problem characteristics. The objective is to estimate machines that concentrate critical operations and identify characteristics that contribute to the definition of local search methods that do not depend on the calculation of the critical path for each solution. Computational experiments with usual instances from literature show that there is a concentration of critical operations in some machines and, in some cases, a positive correlation between this concentration and the average processing times of the operations, which can provide subsidies for creating more efficient local search methods.Este trabajo estudia el problema de programación de la producción clásica en la tienda de empleo para minimizar a Makespan. Debido a la naturaleza combinativa y la complejidad computacional de este problema, el uso de técnicas metaheurísticas aliadas a los métodos de búsqueda locales está generalizada al permitir los resultados satisfactorios en un tiempo computacional viable. En general, los métodos de búsqueda locales se basan en permutaciones empíricas de operaciones que conforman la ruta crítica de una solución, llama a operaciones críticas, que exige el cálculo del camino crítico para cada una de las soluciones generadas en el proceso de búsqueda. Además de elevar el costo computacional de la búsqueda local, dicho enfoque promueve permutaciones de operaciones que no resultan en ninguna mejora en la solución. Este trabajo investiga la distribución de operaciones críticas sobre máquinas y correlación entre esta distribución y características estadísticas de los problemas. El objetivo es estimar las máquinas que concentren las operaciones críticas e identifican las características que pueden contribuir a la definición de métodos de búsqueda locales que no dependen del cálculo del camino crítico a cada solución. Los experimentos computacionales con instancias habituales de literatura muestran que hay una concentración de operaciones críticas en algunas máquinas y, en algunos casos, una correlación positiva significativa entre esta concentración y los tiempos de procesamiento de operaciones promedio, lo que puede proporcionar subsidios para crear métodos de búsqueda computacionalmente más eficientes.Este trabalho estuda o problema clássico de agendamento da produção em job shop para minimização do makespan. Devido à natureza combinatória e complexidade computacional desse problema, o uso de técnicas metaheurísticas aliadas a métodos de busca local é bastante difundido por possibilitar resultados satisfatórios em um tempo computacional viável. Em geral, os métodos de busca local se baseiam em permutações empíricas das operações que compõe o caminho crítico de uma solução, as chamadas operações críticas, o que demanda o cálculo do caminho crítico para cada uma das soluções geradas no processo de busca. Além de elevar o custo computacional da busca local, tal abordagem promove permutações de operações que não resultam em qualquer melhoria da solução. Este trabalho investiga a distribuição das operações críticas nas máquinas e a correlação entre essa distribuição e características estatísticas dos problemas. O objetivo é estimar máquinas que concentram operações críticas e identificar características que possam contribuir para definição de métodos de busca local que não dependam do cálculo do caminho crítico a cada solução. Experimentos computacionais com instâncias usuais da literatura mostram que há uma concentração de operações críticas em algumas máquinas e, em alguns casos, uma correlação positiva significativa entre essa concentração e os tempos médios de processamento das operações, o que pode fornecer subsídios para criação de métodos de busca local computacionalmente mais eficientes.Research, Society and Development2022-04-02info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://rsdjournal.org/index.php/rsd/article/view/2803510.33448/rsd-v11i5.28035Research, Society and Development; Vol. 11 No. 5; e17111528035Research, Society and Development; Vol. 11 Núm. 5; e17111528035Research, Society and Development; v. 11 n. 5; e171115280352525-3409reponame:Research, Society and Developmentinstname:Universidade Federal de Itajubá (UNIFEI)instacron:UNIFEIporhttps://rsdjournal.org/index.php/rsd/article/view/28035/24443Copyright (c) 2022 Jonathan Farias Bordignon; Luis Carlos Caparroz dos Santos; Marilda Fátima de Souza da Silva; Fabio Henrique Pereirahttps://creativecommons.org/licenses/by/4.0info:eu-repo/semantics/openAccessBordignon, Jonathan Farias Santos, Luis Carlos Caparroz dos Silva, Marilda Fátima de Souza daPereira, Fabio Henrique2022-04-17T18:18:56Zoai:ojs.pkp.sfu.ca:article/28035Revistahttps://rsdjournal.org/index.php/rsd/indexPUBhttps://rsdjournal.org/index.php/rsd/oairsd.articles@gmail.com2525-34092525-3409opendoar:2024-01-17T09:45:34.903272Research, Society and Development - Universidade Federal de Itajubá (UNIFEI)false |
dc.title.none.fl_str_mv |
Study on critical operations in job shop scheduling in productive systems Estudio sobre operaciones críticas en las tareas de programación en sistemas productivos de tipo job shop Estudo sobre as operações críticas no agendamento de tarefas em sistemas produtivos do tipo job shop |
title |
Study on critical operations in job shop scheduling in productive systems |
spellingShingle |
Study on critical operations in job shop scheduling in productive systems Bordignon, Jonathan Farias Busca local Caminho Crítico Scheduling Manufatura Planejamento do processo. Búsqueda de ubicación Ruta crítica Programación Fabricación Planificación de processos. Local search Critical path Scheduling Manufacturing Process plan. |
title_short |
Study on critical operations in job shop scheduling in productive systems |
title_full |
Study on critical operations in job shop scheduling in productive systems |
title_fullStr |
Study on critical operations in job shop scheduling in productive systems |
title_full_unstemmed |
Study on critical operations in job shop scheduling in productive systems |
title_sort |
Study on critical operations in job shop scheduling in productive systems |
author |
Bordignon, Jonathan Farias |
author_facet |
Bordignon, Jonathan Farias Santos, Luis Carlos Caparroz dos Silva, Marilda Fátima de Souza da Pereira, Fabio Henrique |
author_role |
author |
author2 |
Santos, Luis Carlos Caparroz dos Silva, Marilda Fátima de Souza da Pereira, Fabio Henrique |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Bordignon, Jonathan Farias Santos, Luis Carlos Caparroz dos Silva, Marilda Fátima de Souza da Pereira, Fabio Henrique |
dc.subject.por.fl_str_mv |
Busca local Caminho Crítico Scheduling Manufatura Planejamento do processo. Búsqueda de ubicación Ruta crítica Programación Fabricación Planificación de processos. Local search Critical path Scheduling Manufacturing Process plan. |
topic |
Busca local Caminho Crítico Scheduling Manufatura Planejamento do processo. Búsqueda de ubicación Ruta crítica Programación Fabricación Planificación de processos. Local search Critical path Scheduling Manufacturing Process plan. |
description |
This work studies the classic problem of job shop scheduling for makespan minimizing. Due to the combinatorial nature and computational complexity of this problem, the use of metaheuristic techniques combined with local search methods is quite widespread as it allows satisfactory results in a viable computational time. In general, local search methods are based on empirical permutations of the operations that make up the critical path of a solution, the so-called critical operations, which demand the calculation of the critical path for each of the solutions generated in the search process. In addition to increasing the computational cost of local search, this approach promotes permutations of operations that do not result in any improvement in the solution. This work investigates the distribution of critical operations on the machines and the correlation between this distribution and problem characteristics. The objective is to estimate machines that concentrate critical operations and identify characteristics that contribute to the definition of local search methods that do not depend on the calculation of the critical path for each solution. Computational experiments with usual instances from literature show that there is a concentration of critical operations in some machines and, in some cases, a positive correlation between this concentration and the average processing times of the operations, which can provide subsidies for creating more efficient local search methods. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-04-02 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://rsdjournal.org/index.php/rsd/article/view/28035 10.33448/rsd-v11i5.28035 |
url |
https://rsdjournal.org/index.php/rsd/article/view/28035 |
identifier_str_mv |
10.33448/rsd-v11i5.28035 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.relation.none.fl_str_mv |
https://rsdjournal.org/index.php/rsd/article/view/28035/24443 |
dc.rights.driver.fl_str_mv |
https://creativecommons.org/licenses/by/4.0 info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by/4.0 |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Research, Society and Development |
publisher.none.fl_str_mv |
Research, Society and Development |
dc.source.none.fl_str_mv |
Research, Society and Development; Vol. 11 No. 5; e17111528035 Research, Society and Development; Vol. 11 Núm. 5; e17111528035 Research, Society and Development; v. 11 n. 5; e17111528035 2525-3409 reponame:Research, Society and Development instname:Universidade Federal de Itajubá (UNIFEI) instacron:UNIFEI |
instname_str |
Universidade Federal de Itajubá (UNIFEI) |
instacron_str |
UNIFEI |
institution |
UNIFEI |
reponame_str |
Research, Society and Development |
collection |
Research, Society and Development |
repository.name.fl_str_mv |
Research, Society and Development - Universidade Federal de Itajubá (UNIFEI) |
repository.mail.fl_str_mv |
rsd.articles@gmail.com |
_version_ |
1797052709016174592 |