Publicação
Dynamic Scheduling for Maintenance Tasks Allocation supported by Genetic Algorithms
| datacite.subject.fos | Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática | pt_PT |
| dc.contributor.advisor | Oliveira, José | |
| dc.contributor.advisor | Parreira-Rocha, Mafalda | |
| dc.contributor.author | Alemão, Duarte José Marques | |
| dc.date.accessioned | 2018-02-19T16:51:11Z | |
| dc.date.available | 2018-02-19T16:51:11Z | |
| dc.date.issued | 2017-12 | |
| dc.date.submitted | 2017 | |
| dc.description.abstract | Since the first factories were created, man has always tried to maximize its production and, consequently, his profits. However, the market demands have changed and nowadays is not so easy to get the maximum yield of it. The production lines are becoming more flexible and dynamic and the amount of information going through the factory is growing more and more. This leads to a scenario where errors in the production scheduling may occur often. Several approaches have been used over the time to plan and schedule the shop-floor’s production. However, some of them do not consider some factors present in real environments, such as the fact that the machines are not available all the time and need maintenance sometimes. This increases the complexity of the system and makes it harder to allocate the tasks competently. So, more dynamic approaches should be used to explore the large search spaces more efficiently. In this work is proposed an architecture and respective implementation to get a schedule including both production and maintenance tasks, which are often ignored on the related works. It considers the maintenance shifts available. The proposed architecture was implemented using genetic algorithms, which already proved to be good solving combinatorial problems such as the Job-Shop Scheduling problem. The architecture considers the precedence order between the tasks of a same product and the maintenance shifts available on the factory. The architecture was tested on a simulated environment to check the algorithm behavior. However, it was used a real data set of production tasks and working stations. | pt_PT |
| dc.identifier.uri | http://hdl.handle.net/10362/30816 | |
| dc.language.iso | eng | pt_PT |
| dc.subject | Job-Shop Scheduling | pt_PT |
| dc.subject | Task Allocation | pt_PT |
| dc.subject | Genetic Algorithms | pt_PT |
| dc.subject | Manufacturing Systems | pt_PT |
| dc.title | Dynamic Scheduling for Maintenance Tasks Allocation supported by Genetic Algorithms | pt_PT |
| dc.type | master thesis | |
| dspace.entity.type | Publication | |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | masterThesis | pt_PT |
| thesis.degree.name | Mestre em Engenharia Eletrotécnica e de Computadores | pt_PT |