Utilize este identificador para citar ou criar um link para este item:
http://acervodigital.unesp.br/handle/11449/40316Registro de metadados completo
| Campo DC | Valor | Idioma |
|---|---|---|
| dc.contributor.author | Moreira, Mayron Cesar O. | - |
| dc.contributor.author | Ritt, Marcus | - |
| dc.contributor.author | Costa, Alysson M. | - |
| dc.contributor.author | Chaves, Antonio A. | - |
| dc.date.accessioned | 2014-05-20T15:31:05Z | - |
| dc.date.accessioned | 2016-10-25T18:06:48Z | - |
| dc.date.available | 2014-05-20T15:31:05Z | - |
| dc.date.available | 2016-10-25T18:06:48Z | - |
| dc.date.issued | 2012-06-01 | - |
| dc.identifier | http://dx.doi.org/10.1007/s10732-012-9195-5 | - |
| dc.identifier.citation | Journal of Heuristics. Dordrecht: Springer, v. 18, n. 3, p. 505-524, 2012. | - |
| dc.identifier.issn | 1381-1231 | - |
| dc.identifier.uri | http://hdl.handle.net/11449/40316 | - |
| dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/40316 | - |
| dc.description.abstract | We 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.sponsorship | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | - |
| dc.description.sponsorship | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | - |
| dc.format.extent | 505-524 | - |
| dc.language.iso | eng | - |
| dc.publisher | Springer | - |
| dc.source | Web of Science | - |
| dc.subject | Assembly lines | en |
| dc.subject | Disabled workers | en |
| dc.subject | Heuristic approaches | en |
| dc.subject | Hybrid genetic algorithm | en |
| dc.title | Simple heuristics for the assembly line worker assignment and balancing problem | en |
| dc.type | outro | - |
| dc.contributor.institution | Universidade de São Paulo (USP) | - |
| dc.contributor.institution | Universidade Federal do Rio Grande do Sul (UFRGS) | - |
| dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
| dc.description.affiliation | Univ São Paulo, Inst Ciencias Matemat & Comp, BR-13560970 São Carlos, SP, Brazil | - |
| dc.description.affiliation | Universidade Federal do Rio Grande do Sul (UFRGS), Inst Informat, Porto Alegre, RS, Brazil | - |
| dc.description.affiliation | Univ Estadual Paulista J de Mesquita Filho, Fac Eng Guaratingueta, São Paulo, Brazil | - |
| dc.description.affiliationUnesp | Univ Estadual Paulista J de Mesquita Filho, Fac Eng Guaratingueta, São Paulo, Brazil | - |
| dc.identifier.doi | 10.1007/s10732-012-9195-5 | - |
| dc.identifier.wos | WOS:000303588800006 | - |
| dc.rights.accessRights | Acesso restrito | - |
| dc.relation.ispartof | Journal 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.
