Você está no menu de acessibilidade

Utilize este identificador para citar ou criar um link para este item: http://acervodigital.unesp.br/handle/11449/40316
Registro de metadados completo
Campo DCValorIdioma
dc.contributor.authorMoreira, Mayron Cesar O.-
dc.contributor.authorRitt, Marcus-
dc.contributor.authorCosta, Alysson M.-
dc.contributor.authorChaves, Antonio A.-
dc.date.accessioned2014-05-20T15:31:05Z-
dc.date.accessioned2016-10-25T18:06:48Z-
dc.date.available2014-05-20T15:31:05Z-
dc.date.available2016-10-25T18:06:48Z-
dc.date.issued2012-06-01-
dc.identifierhttp://dx.doi.org/10.1007/s10732-012-9195-5-
dc.identifier.citationJournal of Heuristics. Dordrecht: Springer, v. 18, n. 3, p. 505-524, 2012.-
dc.identifier.issn1381-1231-
dc.identifier.urihttp://hdl.handle.net/11449/40316-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/40316-
dc.description.abstractWe propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the well-known simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority rules defining the order in which the tasks and workers should be assigned to the workstations. We present a number of such rules and compare their performance across three possible uses: as a stand-alone method, as an initial solution generator for meta-heuristics, and as a decoder for a hybrid genetic algorithm. Our results show that the heuristics are fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.en
dc.description.sponsorshipConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)-
dc.description.sponsorshipFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)-
dc.format.extent505-524-
dc.language.isoeng-
dc.publisherSpringer-
dc.sourceWeb of Science-
dc.subjectAssembly linesen
dc.subjectDisabled workersen
dc.subjectHeuristic approachesen
dc.subjectHybrid genetic algorithmen
dc.titleSimple heuristics for the assembly line worker assignment and balancing problemen
dc.typeoutro-
dc.contributor.institutionUniversidade de São Paulo (USP)-
dc.contributor.institutionUniversidade Federal do Rio Grande do Sul (UFRGS)-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.description.affiliationUniv São Paulo, Inst Ciencias Matemat & Comp, BR-13560970 São Carlos, SP, Brazil-
dc.description.affiliationUniversidade Federal do Rio Grande do Sul (UFRGS), Inst Informat, Porto Alegre, RS, Brazil-
dc.description.affiliationUniv Estadual Paulista J de Mesquita Filho, Fac Eng Guaratingueta, São Paulo, Brazil-
dc.description.affiliationUnespUniv Estadual Paulista J de Mesquita Filho, Fac Eng Guaratingueta, São Paulo, Brazil-
dc.identifier.doi10.1007/s10732-012-9195-5-
dc.identifier.wosWOS:000303588800006-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofJournal of Heuristics-
Aparece nas coleções:Artigos, TCCs, Teses e Dissertações da Unesp

Não há nenhum arquivo associado com este item.
 

Itens do Acervo digital da UNESP são protegidos por direitos autorais reservados a menos que seja expresso o contrário.