Uma heurística para a programação da produção de sistemas flexíveis de manufatura usando modelagem em redes de Petri

Abstract

The Petri Net based Search has been shown as a promising way to solve Flexible manufacturing Systems (FMS) Scheduling Problem. However, the response time is critical since it s a system with high computational complexity. Focusing the reduction of response time, this work proposes a heuristic for Petri Net based Search to solve FMS Scheduling problem of makespan minimization. Experiments showed improvements on response time reduction comparing with prior works