A variable block insertion heuristic for permutation flowshops with makespan criterion

Vista sencilla de ítem
dc.contributor.authorTasgetiren M.F.
dc.contributor.authorPan Q.-K.
dc.contributor.authorKizilay D.
dc.contributor.authorVelez-Gallego M.C.
dc.contributor.departmentUniversidad EAFIT. Departamento de Ingeniería de Producción
dc.contributor.researchgroupGestión de Producción y Logísticaspa
dc.date.accessioned2021-04-12T20:00:22Z
dc.date.available2021-04-12T20:00:22Z
dc.date.issued2017-01-01
dc.description.abstractThis paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size being equal to one. It removes a block from the current solution and inserts it into the partial solution randomly with a predetermined move size. A local search is applied to the solution found after several block moves. If the new solution generated after the local search is better than the current solution, it replaces the current solution. It retains the same block size as long as it improves. Otherwise, the block size is incremented by one and a simulated annealing-type of acceptance criterion is used to accept the new solution. This process is repeated until the block size reaches at the maximum block size. In addition, we present a randomized profile fitting heuristic with excellent results. Extensive computational results on the Taillard's well-known benchmark suite show that the proposed PVBIH algorithm substantially outperforms the differential evolution algorithm (NS-SGDE) recently proposed in the literature. © 2017 IEEE.eng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=6994
dc.identifier.doi10.1109/CEC.2017.7969382
dc.identifier.isbn9781509046010
dc.identifier.otherWOS;000426929700095
dc.identifier.otherSCOPUS;2-s2.0-85027862282
dc.identifier.urihttp://hdl.handle.net/10784/28525
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.relationDOI;10.1109/CEC.2017.7969382
dc.relationWOS;000426929700095
dc.relationSCOPUS;2-s2.0-85027862282
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85027862282&doi=10.1109%2fCEC.2017.7969382&partnerID=40&md5=eee52e494115a6c18fe98bfd83b63b60
dc.rightsInstitute of Electrical and Electronics Engineers Inc.
dc.source2017 Ieee Congress On Evolutionary Computation, Cec 2017 - Proceedings
dc.subject.keywordFlowshop schedulingeng
dc.subject.keywordHeuristic optimizationeng
dc.subject.keywordLocal searcheng
dc.subject.keywordRandomized profile fitting heuristiceng
dc.subject.keywordVariable block insertion heuristiceng
dc.titleA variable block insertion heuristic for permutation flowshops with makespan criterioneng
dc.typeConference Paper
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeinfo:eu-repo/semantics/conferencePapereng
dc.typeconferencePapereng
dc.typeinfo:eu-repo/semantics/publishedVersioneng
dc.typepublishedVersioneng
dc.type.localDocumento de conferenciaspa

Archivos

Colecciones

Documento de conferencia