dc.creatorArroyo, José Elias Claudio
dc.creatorPereira, Ana Amélia de Souza
dc.date2018-08-30T17:08:03Z
dc.date2018-08-30T17:08:03Z
dc.date2011-07
dc.date.accessioned2023-09-27T22:10:31Z
dc.date.available2023-09-27T22:10:31Z
dc.identifier14333015
dc.identifierhttps://doi.org/10.1007/s00170-010-3100-x
dc.identifierhttp://www.locus.ufv.br/handle/123456789/21547
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/8971696
dc.descriptionThis paper presents a multi-objective greedy randomized adaptive search procedure (GRASP)-based heuristic for solving the permutation flowshop scheduling problem in order to minimize two and three objectives simultaneously: (1) makespan and maximum tardiness; (2) makespan, maximum tardiness, and total flowtime. GRASP is a competitive metaheuristic for solving combinatorial optimization problems. We have customized the basic concepts of GRASP algorithm to solve a multi-objective problem and a new algorithm named multi-objective GRASP algorithm is proposed. In order to find a variety of non-dominated solutions, the heuristic blends two typical approaches used in multi-objective optimization: scalarizing functions and Pareto dominance. For instances involving two machines, the heuristic is compared with a bi-objective branch-and-bound algorithm proposed in the literature. For instances involving up to 80 jobs and 20 machines, the non-dominated solutions obtained by the heuristic are compared with solutions obtained by multi-objective genetic algorithms from the literature. Computational results indicate that GRASP is a promising approach for multi-objective optimization.
dc.formatpdf
dc.formatapplication/pdf
dc.languageeng
dc.publisherThe International Journal of Advanced Manufacturing Technology
dc.relationv. 55, n. 5– 8, p. 741– 753, july 2011
dc.rightsSpringer-Verlag London Limited
dc.subjectFlowshop scheduling
dc.subjectMulti-objective combinatorial optimization
dc.subjectHeuristics
dc.subjectGRASP
dc.titleA GRASP heuristic for the multi-objective permutation flowshop scheduling problem
dc.typeArtigo


Este ítem pertenece a la siguiente institución