1 resultado para Job Shop Problem
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)
Filtro por publicador
- Repository Napier (3)
- Abertay Research Collections - Abertay University’s repository (1)
- Aberystwyth University Repository - Reino Unido (6)
- Academic Archive On-line (Karlstad University; Sweden) (1)
- Adam Mickiewicz University Repository (5)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (1)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (29)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (11)
- Aston University Research Archive (11)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (4)
- Boston University Digital Common (9)
- Brock University, Canada (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (3)
- CaltechTHESIS (6)
- Cambridge University Engineering Department Publications Database (74)
- CentAUR: Central Archive University of Reading - UK (1)
- Center for Jewish History Digital Collections (5)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (49)
- Cochin University of Science & Technology (CUSAT), India (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- Cornell: DigitalCommons@ILR (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Department of Computer Science E-Repository - King's College London, Strand, London (4)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (2)
- Digital Commons at Florida International University (13)
- DigitalCommons@The Texas Medical Center (1)
- DRUM (Digital Repository at the University of Maryland) (3)
- Duke University (4)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (6)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Funes: Repositorio digital de documentos en Educación Matemática - Colombia (1)
- Greenwich Academic Literature Archive - UK (65)
- Helda - Digital Repository of University of Helsinki (32)
- Indian Institute of Science - Bangalore - Índia (140)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (5)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- Ministerio de Cultura, Spain (1)
- Nottingham eTheses (3)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (8)
- Portal de Revistas Científicas Complutenses - Espanha (3)
- QSpace: Queen's University - Canada (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (71)
- Queensland University of Technology - ePrints Archive (339)
- RDBU - Repositório Digital da Biblioteca da Unisinos (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (3)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- Universidad de Alicante (1)
- Universidad del Rosario, Colombia (3)
- Universidad Politécnica de Madrid (3)
- University of Michigan (4)
- University of Queensland eSpace - Australia (1)
Resumo:
In this paper we consider the programming of job rotation in the assembly line worker assignment and balancing problem. The motivation for this study comes from the designing of assembly lines in sheltered work centers for the disabled, where workers have different task execution times. In this context, the well-known training aspects associated with job rotation are particularly desired. We propose a metric along with a mixed integer linear model and a heuristic decomposition method to solve this new job rotation problem. Computational results show the efficacy of the proposed heuristics. (C) 2009 Elsevier B.V. All rights reserved.