2024-03-28T12:39:25Z
https://u-ryukyu.repo.nii.ac.jp/oai
oai:u-ryukyu.repo.nii.ac.jp:02011305
2023-08-03T05:32:55Z
1642838163960:1642838338003
1642838403551:1642838406845
Automatic Generation of Mixed Integer Programming for Scheduling Problems Based on Colored Timed Petri Nets
Porco, Andrea Veronica
Ushijima, Ryosuke
Nakamura, Morikazu
scheduling problem
mixed integer programming
Petri nets
colored timed Petri net
automatic generation
This paper proposes a scheme for automatic generation of mixed-integer programming problems for scheduling with multiple resources based on colored timed Petri nets. Our method reads Petri net data modeled by users, extracts the precedence and conflict relations among transitions, information on the available resources, and finally generates a mixed integer linear programming for exactly solving the target scheduling problem. The mathematical programing problems generated by our tool can be easily inputted to well-known optimizers. The results of this research can extend the usability of optimizers since our tool requires just simple rules of Petri nets but not deep mathematical knowledge.
論文
http://purl.org/coar/resource_type/c_6501
The Institute of Electronics, Information and Communication Engineers
一般社団法人 電子情報通信学会
2018-02-01
VoR
http://hdl.handle.net/20.500.12000/47487
1745-1337
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
2
E101-A
372
367
eng
https://doi.org/10.1587/transfun.E101.A.367
https://doi.org/10.1587/transfun.E101.A.367
open access
©2018 IEICE