Simulation optimization for a flexible Jobs hops cheduling problem using an estimation of distribution algorithm
The flexible jobshop scheduling problem permits the operation of each job to be processed by more than one machine. The idea is to assign the processing sequence of operations on the machines and the assignment of operations on machines such that the system objectives can be optimized. The assignmen...
| Autor: | |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2014 |
| País: | México |
| Recursos: | Centro de Innovación Aplicada en Tecnologías Competitivas |
| Repositorio: | Repositorio Institucional de CIATEC |
| OAI Identifier: | oai:ciatec.repositorioinstitucional.mx:1019/91 |
| Acesso em linha: | http://ciatec.repositorioinstitucional.mx/jspui/handle/1019/91 |
| Access Level: | acceso abierto |
| Palavra-chave: | info:eu-repo/classification/LEMD/Algoritmos computacionales info:eu-repo/classification/LEMD/Métodos de simulación info:eu-repo/classification/cti/7 info:eu-repo/classification/cti/33 info:eu-repo/classification/cti/3304 info:eu-repo/classification/cti/120302 |
| Resumo: | The flexible jobshop scheduling problem permits the operation of each job to be processed by more than one machine. The idea is to assign the processing sequence of operations on the machines and the assignment of operations on machines such that the system objectives can be optimized. The assignment mentioned is a difficult task to implement on real manufacturing environments because there are many assumptions to satisfy, especially when the amount of work is not constant or sufficient tokeep the manufacturing process busy for a long time, causing intermittent idle times. An estimation of distribution algorithm-based approach coupled with a simulation model is developed to solve the problema and implement the solution. Using the proposed approach, the shop performance can be noticeably improved when different machines are assigned to different schedules. |
|---|