Performance enhancement of numerical approaches for scheduling problem on machine single
Autor(a) principal: | |
---|---|
Data de Publicação: | 2021 |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Independent Journal of Management & Production |
Texto Completo: | http://www.ijmp.jor.br/index.php/ijmp/article/view/1029 |
Resumo: | In this paper, we consider a single-machine scheduling problem, with the aim of minimizing the weighted sum of the completion time. This problem is NP-hard, making the search for an optimal solution very difficult. In this frame, two heuristics (H1), (H2) and metaheuristic tabu search are suggested.To improve the performance of this techniques, we used, on one hand, different diversification strategies (TES1 and TES2) with the aim of exploring unvisited regions of the solution space. On the other hand, we suggested three types of neighborhoods (neighborhood by swapping, neighborhood by insertion and neighborhood by blocks).It must be noted that tasks movement can be within one period or between different periods. |
id |
IJMP_517ae7ea4be90c90bde5d058d86a054f |
---|---|
oai_identifier_str |
oai:www.ijmp.jor.br:article/1029 |
network_acronym_str |
IJMP |
network_name_str |
Independent Journal of Management & Production |
repository_id_str |
|
spelling |
Performance enhancement of numerical approaches for scheduling problem on machine singleSchedulingSingle machineNP-hardTabu searchIn this paper, we consider a single-machine scheduling problem, with the aim of minimizing the weighted sum of the completion time. This problem is NP-hard, making the search for an optimal solution very difficult. In this frame, two heuristics (H1), (H2) and metaheuristic tabu search are suggested.To improve the performance of this techniques, we used, on one hand, different diversification strategies (TES1 and TES2) with the aim of exploring unvisited regions of the solution space. On the other hand, we suggested three types of neighborhoods (neighborhood by swapping, neighborhood by insertion and neighborhood by blocks).It must be noted that tasks movement can be within one period or between different periods.Independent2021-10-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdftext/htmlhttp://www.ijmp.jor.br/index.php/ijmp/article/view/102910.14807/ijmp.v12i7.1029Independent Journal of Management & Production; Vol. 12 No. 7 (2021): Independent Journal of Management & Production; 1739-17502236-269X2236-269Xreponame:Independent Journal of Management & Productioninstname:Instituto Federal de Educação, Ciência e Tecnologia de São Paulo (IFSP)instacron:IJM&Penghttp://www.ijmp.jor.br/index.php/ijmp/article/view/1029/1875http://www.ijmp.jor.br/index.php/ijmp/article/view/1029/1876Copyright (c) 2020 Omar Selthttp://creativecommons.org/licenses/by-nc-sa/4.0info:eu-repo/semantics/openAccessSelt, Omar2021-12-02T01:56:05Zoai:www.ijmp.jor.br:article/1029Revistahttp://www.ijmp.jor.br/PUBhttp://www.ijmp.jor.br/index.php/ijmp/oaiijmp@ijmp.jor.br||paulo@paulorodrigues.pro.br||2236-269X2236-269Xopendoar:2021-12-02T01:56:05Independent Journal of Management & Production - Instituto Federal de Educação, Ciência e Tecnologia de São Paulo (IFSP)false |
dc.title.none.fl_str_mv |
Performance enhancement of numerical approaches for scheduling problem on machine single |
title |
Performance enhancement of numerical approaches for scheduling problem on machine single |
spellingShingle |
Performance enhancement of numerical approaches for scheduling problem on machine single Selt, Omar Scheduling Single machine NP-hard Tabu search |
title_short |
Performance enhancement of numerical approaches for scheduling problem on machine single |
title_full |
Performance enhancement of numerical approaches for scheduling problem on machine single |
title_fullStr |
Performance enhancement of numerical approaches for scheduling problem on machine single |
title_full_unstemmed |
Performance enhancement of numerical approaches for scheduling problem on machine single |
title_sort |
Performance enhancement of numerical approaches for scheduling problem on machine single |
author |
Selt, Omar |
author_facet |
Selt, Omar |
author_role |
author |
dc.contributor.author.fl_str_mv |
Selt, Omar |
dc.subject.por.fl_str_mv |
Scheduling Single machine NP-hard Tabu search |
topic |
Scheduling Single machine NP-hard Tabu search |
description |
In this paper, we consider a single-machine scheduling problem, with the aim of minimizing the weighted sum of the completion time. This problem is NP-hard, making the search for an optimal solution very difficult. In this frame, two heuristics (H1), (H2) and metaheuristic tabu search are suggested.To improve the performance of this techniques, we used, on one hand, different diversification strategies (TES1 and TES2) with the aim of exploring unvisited regions of the solution space. On the other hand, we suggested three types of neighborhoods (neighborhood by swapping, neighborhood by insertion and neighborhood by blocks).It must be noted that tasks movement can be within one period or between different periods. |
publishDate |
2021 |
dc.date.none.fl_str_mv |
2021-10-01 |
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 |
http://www.ijmp.jor.br/index.php/ijmp/article/view/1029 10.14807/ijmp.v12i7.1029 |
url |
http://www.ijmp.jor.br/index.php/ijmp/article/view/1029 |
identifier_str_mv |
10.14807/ijmp.v12i7.1029 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
http://www.ijmp.jor.br/index.php/ijmp/article/view/1029/1875 http://www.ijmp.jor.br/index.php/ijmp/article/view/1029/1876 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2020 Omar Selt http://creativecommons.org/licenses/by-nc-sa/4.0 info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2020 Omar Selt http://creativecommons.org/licenses/by-nc-sa/4.0 |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf text/html |
dc.publisher.none.fl_str_mv |
Independent |
publisher.none.fl_str_mv |
Independent |
dc.source.none.fl_str_mv |
Independent Journal of Management & Production; Vol. 12 No. 7 (2021): Independent Journal of Management & Production; 1739-1750 2236-269X 2236-269X reponame:Independent Journal of Management & Production instname:Instituto Federal de Educação, Ciência e Tecnologia de São Paulo (IFSP) instacron:IJM&P |
instname_str |
Instituto Federal de Educação, Ciência e Tecnologia de São Paulo (IFSP) |
instacron_str |
IJM&P |
institution |
IJM&P |
reponame_str |
Independent Journal of Management & Production |
collection |
Independent Journal of Management & Production |
repository.name.fl_str_mv |
Independent Journal of Management & Production - Instituto Federal de Educação, Ciência e Tecnologia de São Paulo (IFSP) |
repository.mail.fl_str_mv |
ijmp@ijmp.jor.br||paulo@paulorodrigues.pro.br|| |
_version_ |
1797220492344557568 |