Publicação
Solving flexible job shop scheduling using genetic algorithm
| Resumo: | This work addresses a real assembly cell: the AIP-PRIMECA cell at the Université e de Valenciennes et du Hainaut-Cambrésis, in France. This system can be viewed as a Flexible Job Shop, leading to the formulation of a Flexible Job Shop Scheduling Problem (FJSSP). This FJSSP offers the possibility to create the products "AIP", "LATE" and "BELT" using by five workstations, each one being able to perform a set of operations, that are linked using a conveyor system. The transportation between stations is achieved using a shuttle which is able to transport one product at the time, being released after the product processing conclusion. The problem consists in finding a operations schedule on the machines, taking into account the precedence constraints minimizing the batch makespan, i.e., the finish time of the last operation completed in the schedule. To solve the flexible job shop the genetic algorithm (GA) was used to obtain the global solution. |
|---|---|
| Autores principais: | Pereira, Ana I. |
| Outros Autores: | Curralo, Ana; Barbosa, José; Leitão, Paulo |
| Assunto: | Optimização global Job shop |
| Ano: | 2013 |
| País: | Portugal |
| Tipo de documento: | documento de conferência |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Instituto Politécnico de Bragança |
| Idioma: | inglês |
| Origem: | Biblioteca Digital do IPB |
| Resumo: | This work addresses a real assembly cell: the AIP-PRIMECA cell at the Université e de Valenciennes et du Hainaut-Cambrésis, in France. This system can be viewed as a Flexible Job Shop, leading to the formulation of a Flexible Job Shop Scheduling Problem (FJSSP). This FJSSP offers the possibility to create the products "AIP", "LATE" and "BELT" using by five workstations, each one being able to perform a set of operations, that are linked using a conveyor system. The transportation between stations is achieved using a shuttle which is able to transport one product at the time, being released after the product processing conclusion. The problem consists in finding a operations schedule on the machines, taking into account the precedence constraints minimizing the batch makespan, i.e., the finish time of the last operation completed in the schedule. To solve the flexible job shop the genetic algorithm (GA) was used to obtain the global solution. |
|---|