The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem

Simple item page
dc.contributor.authorBenavides, A.J.
dc.contributor.authorVera, A.
dc.date.accessioned2022-03-11T00:56:47Z
dc.date.available2022-03-11T00:56:47Z
dc.date.issued2021
dc.description.abstractThe 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 problemes_PE
dc.description.uriTrabajo académicoes_PE
dc.identifier.doi10.1016/j.ejor.2021.05.014es_PE
dc.identifier.issn03772217
dc.identifier.urihttps://hdl.handle.net/20.500.12590/17082
dc.language.isoenges_PE
dc.publisherElsevier B.V.es_PE
dc.publisher.countryPEes_PE
dc.relationinfo:eu-repo/semantics/articlees_PE
dc.relation.urihttps://www.scopus.com/record/display.uri?eid=2-s2.0-85108374787&origin=resultslist&sort=plf-f&src=s&st1=The+reversibility+property+in+a+job-insertion+tiebreaker+for+the+permutational+flow+shop+scheduling+problem&sid=8060809f746591f29588460ddfbfa739&sot=b&sdt=b&sl=122&s=TITLE-ABS-KEY%28The+reversibility+property+in+a+job-insertion+tiebreaker+for+the+permutational+flow+shop+scheduling+problem%29&relpos=0&citeCnt=0&searchTerm=&featureToggles=FEATURE_NEW_DOC_DETAILS_EXPORT:1es_PE
dc.rightsinfo:eu-repo/semantics/restrictedAccesses_PE
dc.sourceUniversidad Católica San Pabloes_PE
dc.sourceRepositorio Institucional - UCSPes_PE
dc.subjectFlow shopes_PE
dc.subjectHeuristicses_PE
dc.subjectMakespanes_PE
dc.subjectSchedulinges_PE
dc.subjectTiebreakeres_PE
dc.subject.ocdehttps://purl.org/pe-repo/ocde/ford#2.07.00es_PE
dc.titleThe reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problemes_PE
dc.typeinfo:eu-repo/semantics/article
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_PE
renati.typehttps://purl.org/pe-repo/renati/type#trabajoAcademico
thesis.degree.disciplineIngeniería Industriales_PE
thesis.degree.grantorUniversidad Católica San Pablo. Departamento de Ingeniería Industriales_PE
thesis.degree.programPrograma Profesional de Ingeniería Industriales_PE
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Artículos - Ingeniería Industrial