Summary

International Technical Conference on Circuits/Systems, Computers and Communications

2016

Session Number:M3-1

Session:

Number:M3-1-6

Automated Generation of Mixed Integer Programming for Job-shop Scheduling Problems based on Petri Nets

Ryosuke Ushijima,  Andrea Veronica Porco,  Hideki Kinjo,  Morikazu Nakamura ,  

pp.287-290

Publication Date:2016/7/10

Online ISSN:2188-5079

DOI:10.34385/proc.61.M3-1-6

PDF download (1.5MB)

Summary:
This paper proposes a scheme for automated generation of a mixed-integer programming for scheduling problems based on timed Petri nets. Our tool reads XML-based Petri net data, extract precedence and conflict relations among transitions and then generates a mixed integer programming for the target scheduling problem. Therefore, once users model their system with Petri nets, they can address the scheduling problem for efficient operations. For implementation, we use CPN Tools, a well-known tool for editing, simulating and analyzing Colored Petri nets, for modeling. Users can model their systems with CPN Tools and then generate a mixed-integer programming problem for scheduling.