Iterated local search and constructive heuristics for minimizing total tardiness in flexible job shop

dc.creatorMelo, Everton Luiz de
dc.date.accessioned2014-05-22T13:43:02Z
dc.date.accessioned2018-07-04T16:48:29Z
dc.date.available2014-05-22T13:43:02Z
dc.date.available2018-07-04T16:48:29Z
dc.date.created2014-05-22T13:43:02Z
dc.date.issued2013
dc.identifierhttp://www.producao.usp.br/handle/BDPI/44975
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1640636
dc.description.abstractAn Iterated Local Search (ILS) is used to minimize total tardiness in the Flexible Job Shop. New priority rules associated with list scheduling algorithms that exploit characteristics of the problem are proposed. The ILS uses a larger neighborhood than the literature reference. Computational tests using a new set of 600 instances show that the proposed priority rules outperform the literature rules. Moreover the proposed ILS has a better performance than the literature reference metaheuristc
dc.languageeng
dc.publisherInstitute for Operations Research and the Management Sciences - INFORMS
dc.publisherMinneapolis, Minnesota
dc.relationInforms Annual Meeting
dc.rightsINFORMS
dc.rightsopenAccess
dc.subjectOTIMIZAÇÃO COMBINATÓRIA
dc.subjectPROGRAMAÇÃO DA PRODUÇÃO
dc.subjectMODELOS MATEMÁTICOS
dc.subjectHEURÍSTICA
dc.titleIterated local search and constructive heuristics for minimizing total tardiness in flexible job shop
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución