A Heuristic based on Petri Nets modeling for FMS Scheduling problem of makespan minimization

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.