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

Simple item page
dc.contributor.advisorBenavides Rojas, Alexander Javier
dc.contributor.authorVera Villegas, Antony Hector
dc.date.accessioned2024-10-27T19:27:18Z
dc.date.available2024-10-27T19:27:18Z
dc.date.issued2024
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 problem.
dc.description.uriTrabajo académico
dc.formatapplication/pdf
dc.identifier.doihttps://doi.org/10.1016/j.ejor.2021.05.014
dc.identifier.urihttps://hdl.handle.net/20.500.12590/18365
dc.language.isoeng
dc.publisherUniversidad Católica San Pablo
dc.publisher.countryPE
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectScheduling
dc.subjectFlow shop
dc.subjectMakespan
dc.subjectTiebreaker
dc.subjectHeuristics
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#2.11.04
dc.titleThe reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
dc.typeinfo:eu-repo/semantics/article
dc.type.versioninfo:eu-repo/semantics/publishedVersion
renati.advisor.dni40254989
renati.advisor.orcidhttps://orcid.org/0000-0002-1316-7171
renati.author.dni73303758
renati.discipline722026
renati.jurorAnchayhua Arestegui, Nilton Cesar
renati.jurorAguilar Franco, Jose Alberto
renati.levelhttps://purl.org/pe-repo/renati/level#tituloProfesional
renati.typehttps://purl.org/pe-repo/renati/type#trabajoAcademico
thesis.degree.disciplineIngeniería Industrial
thesis.degree.grantorUniversidad Católica San Pablo. Departamento de Ingenierías de la Industria y el Ambiente
thesis.degree.levelTítulo Profesional
thesis.degree.nameIngeniero Industrial
thesis.degree.programEscuela Profesional Ingeniería Industrial
Files
Original bundle
Now showing 1 - 5 of 6
Thumbnail Image
Name:
RESUMEN.pdf
Size:
55.07 KB
Format:
Adobe Portable Document Format
Download
No Thumbnail Available
Name:
VERA_VILLEGAS_ANT_REV.pdf
Size:
760.93 KB
Format:
Adobe Portable Document Format
Download
Thumbnail Image
Name:
RESUMEN.pdf
Size:
55.07 KB
Format:
Adobe Portable Document Format
Download
No Thumbnail Available
Name:
TURNITIN.pdf
Size:
5.84 MB
Format:
Adobe Portable Document Format
Download
Thumbnail Image
Name:
RESUMEN.pdf
Size:
55.07 KB
Format:
Adobe Portable Document Format
Download
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