Full text
| |
| Author(s): |
Felipe Francisco Bezerra Araújo
Total Authors: 1
|
| Document type: | Master's Dissertation |
| Press: | São Carlos. |
| Institution: | Universidade de São Paulo (USP). Instituto de Ciências Matemáticas e de Computação (ICMC/SB) |
| Defense date: | 2011-05-03 |
| Examining board members: |
Alysson Machado Costa;
Antonio Augusto Chaves;
Reinaldo Morabito Neto
|
| Advisor: | Alysson Machado Costa |
| Abstract | |
The assembly line and worker assignment balancing problem is an extension of the classical simple assembly line balancing problem where task execution times are workerdependent. This problem is motivated by the situation faced when balancing assembly lines with disabled workers. In this study, we focus on an extension for the problem with the goal of including the possibility of having layouts with parallel workstations. We also study a second variation for this problem that allows workers collaborating with each other. We present mathematical formulations for both problems. Moreover, constructive heuristics are developed, based on heuristic methods for the serial assembly line worker assignment and balancing problem. Computational tests on literature instances and a detailed analysis of the results are reported (AU) | |
| FAPESP's process: | 09/02894-3 - Optimization of assembly lines with disabled workers and parallel machines |
| Grantee: | Felipe Francisco Bezerra Araújo |
| Support Opportunities: | Scholarships in Brazil - Master |