The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
Descripción del Articulo
We are indebted to Profs. Victor Fernandez-Viagas and Weibo Liu for generously sharing their code and for guiding us on the reimplementation of their tiebreakers. We are very grateful to the referees, for their valuable comments on earlier versions of this paper. This research has been partially sup...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Fecha de Publicación: | 2021 |
| Institución: | Consejo Nacional de Ciencia Tecnología e Innovación |
| Repositorio: | CONCYTEC-Institucional |
| Lenguaje: | inglés |
| OAI Identifier: | oai:repositorio.concytec.gob.pe:20.500.12390/3065 |
| Enlace del recurso: | https://hdl.handle.net/20.500.12390/3065 https://doi.org/10.1016/j.ejor.2021.05.014 |
| Nivel de acceso: | acceso abierto |
| Materia: | Tiebreaker Flow shop Heuristics Makespan Scheduling https://purl.org/pe-repo/ocde/ford#2.02.04 |
| id |
CONC_0c18b4f14ca799de2d2d72e8bcd24929 |
|---|---|
| oai_identifier_str |
oai:repositorio.concytec.gob.pe:20.500.12390/3065 |
| network_acronym_str |
CONC |
| network_name_str |
CONCYTEC-Institucional |
| repository_id_str |
4689 |
| dc.title.none.fl_str_mv |
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem |
| title |
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem |
| spellingShingle |
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem Benavides A.J. Tiebreaker Flow shop Heuristics Makespan Scheduling https://purl.org/pe-repo/ocde/ford#2.02.04 |
| title_short |
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem |
| title_full |
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem |
| title_fullStr |
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem |
| title_full_unstemmed |
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem |
| title_sort |
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem |
| author |
Benavides A.J. |
| author_facet |
Benavides A.J. Vera A. |
| author_role |
author |
| author2 |
Vera A. |
| author2_role |
author |
| dc.contributor.author.fl_str_mv |
Benavides A.J. Vera A. |
| dc.subject.none.fl_str_mv |
Tiebreaker |
| topic |
Tiebreaker Flow shop Heuristics Makespan Scheduling https://purl.org/pe-repo/ocde/ford#2.02.04 |
| dc.subject.es_PE.fl_str_mv |
Flow shop Heuristics Makespan Scheduling |
| dc.subject.ocde.none.fl_str_mv |
https://purl.org/pe-repo/ocde/ford#2.02.04 |
| description |
We are indebted to Profs. Victor Fernandez-Viagas and Weibo Liu for generously sharing their code and for guiding us on the reimplementation of their tiebreakers. We are very grateful to the referees, for their valuable comments on earlier versions of this paper. This research has been partially supported by the Fondo Nacional de Desarrollo Cient?fico, Tecnol?gico y de Innovaci?n Tecnol?gica (FONDECYT) and the World Bank through projects Kusisqa (014/2019 - FONDECYT - BM - INC.INV) and Het-FSSP (445/2019 - FONDECYT - PIB); and by the supercomputing center ?Inkari? of the Universidad Nacional de San Agust?n de Arequipa. |
| publishDate |
2021 |
| dc.date.accessioned.none.fl_str_mv |
2024-05-30T23:13:38Z |
| dc.date.available.none.fl_str_mv |
2024-05-30T23:13:38Z |
| dc.date.issued.fl_str_mv |
2021 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article |
| format |
article |
| dc.identifier.uri.none.fl_str_mv |
https://hdl.handle.net/20.500.12390/3065 |
| dc.identifier.doi.none.fl_str_mv |
https://doi.org/10.1016/j.ejor.2021.05.014 |
| dc.identifier.scopus.none.fl_str_mv |
2-s2.0-85108374787 |
| url |
https://hdl.handle.net/20.500.12390/3065 https://doi.org/10.1016/j.ejor.2021.05.014 |
| identifier_str_mv |
2-s2.0-85108374787 |
| dc.language.iso.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.ispartof.none.fl_str_mv |
European Journal of Operational Research |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess |
| eu_rights_str_mv |
openAccess |
| dc.publisher.none.fl_str_mv |
Elsevier B.V. |
| publisher.none.fl_str_mv |
Elsevier B.V. |
| dc.source.none.fl_str_mv |
reponame:CONCYTEC-Institucional instname:Consejo Nacional de Ciencia Tecnología e Innovación instacron:CONCYTEC |
| instname_str |
Consejo Nacional de Ciencia Tecnología e Innovación |
| instacron_str |
CONCYTEC |
| institution |
CONCYTEC |
| reponame_str |
CONCYTEC-Institucional |
| collection |
CONCYTEC-Institucional |
| repository.name.fl_str_mv |
Repositorio Institucional CONCYTEC |
| repository.mail.fl_str_mv |
repositorio@concytec.gob.pe |
| _version_ |
1844883106888155136 |
| spelling |
Publicationrp08847600rp08846600Benavides A.J.Vera A.2024-05-30T23:13:38Z2024-05-30T23:13:38Z2021https://hdl.handle.net/20.500.12390/3065https://doi.org/10.1016/j.ejor.2021.05.0142-s2.0-85108374787We are indebted to Profs. Victor Fernandez-Viagas and Weibo Liu for generously sharing their code and for guiding us on the reimplementation of their tiebreakers. We are very grateful to the referees, for their valuable comments on earlier versions of this paper. This research has been partially supported by the Fondo Nacional de Desarrollo Cient?fico, Tecnol?gico y de Innovaci?n Tecnol?gica (FONDECYT) and the World Bank through projects Kusisqa (014/2019 - FONDECYT - BM - INC.INV) and Het-FSSP (445/2019 - FONDECYT - PIB); and by the supercomputing center ?Inkari? of the Universidad Nacional de San Agust?n de Arequipa.The best performing approximate methods proposed for the permutational flow shop scheduling problem with makespan minimization are the well known NEH constructive heuristic and the iterated greedy algorithm. Both methods are based on the successive insertion (or reinsertion) of jobs into a partial schedule, evaluating the makespan of the resulting schedule for all insertion positions, and selecting the insertion position that presents the shortest makespan. Frequently, there are many tied insertion positions that produce such shortest makespan. Thus, a tiebreaker must be used to discern a selection among the tied insertion positions. Many tiebreakers have been proposed in the literature for this case. These tiebreakers improve the results produced by approximate methods when embedded into them. In this paper we propose two new tiebreakers that use a weighted and an unweighted approximation of the idle time increment produced by inserting the job into each tied insertion position. They were designed considering the reversibility property of the PFSSP. Our computational experiments show that the proposed tiebreakers outperform tiebreakers from the literature when evaluated within the NEH heuristic and within the iterated greedy algorithm. The iterated greedy algorithms with the proposed tiebreakers embedded are the best approximate methods so far for the permutational flow shop scheduling problem. © 2021 Elsevier B.V.Consejo Nacional de Ciencia, Tecnología e Innovación Tecnológica - ConcytecengElsevier B.V.European Journal of Operational Researchinfo:eu-repo/semantics/openAccessTiebreakerFlow shop-1Heuristics-1Makespan-1Scheduling-1https://purl.org/pe-repo/ocde/ford#2.02.04-1The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling probleminfo:eu-repo/semantics/articlereponame:CONCYTEC-Institucionalinstname:Consejo Nacional de Ciencia Tecnología e Innovacióninstacron:CONCYTEC20.500.12390/3065oai:repositorio.concytec.gob.pe:20.500.12390/30652024-05-30 16:13:40.43http://purl.org/coar/access_right/c_14cbinfo:eu-repo/semantics/closedAccessmetadata only accesshttps://repositorio.concytec.gob.peRepositorio Institucional CONCYTECrepositorio@concytec.gob.pe#PLACEHOLDER_PARENT_METADATA_VALUE##PLACEHOLDER_PARENT_METADATA_VALUE#<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="59b6a529-c9c0-48d0-9264-a85eb45b2130"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem</Title> <PublishedIn> <Publication> <Title>European Journal of Operational Research</Title> </Publication> </PublishedIn> <PublicationDate>2021</PublicationDate> <DOI>https://doi.org/10.1016/j.ejor.2021.05.014</DOI> <SCP-Number>2-s2.0-85108374787</SCP-Number> <Authors> <Author> <DisplayName>Benavides A.J.</DisplayName> <Person id="rp08847" /> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> <Author> <DisplayName>Vera A.</DisplayName> <Person id="rp08846" /> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Elsevier B.V.</DisplayName> <OrgUnit /> </Publisher> </Publishers> <Keyword>Tiebreaker</Keyword> <Keyword>Flow shop</Keyword> <Keyword>Heuristics</Keyword> <Keyword>Makespan</Keyword> <Keyword>Scheduling</Keyword> <Abstract>The best performing approximate methods proposed for the permutational flow shop scheduling problem with makespan minimization are the well known NEH constructive heuristic and the iterated greedy algorithm. Both methods are based on the successive insertion (or reinsertion) of jobs into a partial schedule, evaluating the makespan of the resulting schedule for all insertion positions, and selecting the insertion position that presents the shortest makespan. Frequently, there are many tied insertion positions that produce such shortest makespan. Thus, a tiebreaker must be used to discern a selection among the tied insertion positions. Many tiebreakers have been proposed in the literature for this case. These tiebreakers improve the results produced by approximate methods when embedded into them. In this paper we propose two new tiebreakers that use a weighted and an unweighted approximation of the idle time increment produced by inserting the job into each tied insertion position. They were designed considering the reversibility property of the PFSSP. Our computational experiments show that the proposed tiebreakers outperform tiebreakers from the literature when evaluated within the NEH heuristic and within the iterated greedy algorithm. The iterated greedy algorithms with the proposed tiebreakers embedded are the best approximate methods so far for the permutational flow shop scheduling problem. © 2021 Elsevier B.V.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication> -1 |
| score |
13.434648 |
Nota importante:
La información contenida en este registro es de entera responsabilidad de la institución que gestiona el repositorio institucional donde esta contenido este documento o set de datos. El CONCYTEC no se hace responsable por los contenidos (publicaciones y/o datos) accesibles a través del Repositorio Nacional Digital de Ciencia, Tecnología e Innovación de Acceso Abierto (ALICIA).
La información contenida en este registro es de entera responsabilidad de la institución que gestiona el repositorio institucional donde esta contenido este documento o set de datos. El CONCYTEC no se hace responsable por los contenidos (publicaciones y/o datos) accesibles a través del Repositorio Nacional Digital de Ciencia, Tecnología e Innovación de Acceso Abierto (ALICIA).
