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

@article{Morandin2007AHB,
  title={A Heuristic based on Petri Nets modeling for FMS Scheduling problem of makespan minimization},
  author={O. Morandin and E. Kato and E.G.R. Maggio and D. S. Sanches and A. C. Deriz},
  journal={IECON 2007 - 33rd Annual Conference of the IEEE Industrial Electronics Society},
  year={2007},
  pages={2683-2688}
}
  • O. Morandin, E. Kato, +2 authors A.C. Deriz
  • Published 2007
  • Computer Science
  • IECON 2007 - 33rd Annual Conference of the IEEE Industrial Electronics Society
  • 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. 

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 15 REFERENCES
    Petri nets: Properties, analysis and applications
    • 10,598