Automatic Generation of Mixed Integer Programming for Scheduling Problems Based on Colored Timed Petri Nets

Andrea Veronica PORCO; Ryosuke USHIJIMA; Morikazu NAKAMURA

doi:10.1587/transfun.E101.A.367

Automatic Generation of Mixed Integer Programming for Scheduling Problems Based on Colored Timed Petri Nets

Andrea Veronica PORCO, Ryosuke USHIJIMA, Morikazu NAKAMURA

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.2 pp.367-372

Publication Date: 2018/02/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E101.A.367

Type of Manuscript: Special Section LETTER (Special Section on Mathematical Systems Science and its Applications)

Category

Authors

Andrea Veronica PORCO
  University of the Ryukyus
Ryosuke USHIJIMA
  University of the Ryukyus
Morikazu NAKAMURA
  University of the Ryukyus

Keyword

scheduling problem, mixed integer programming, Petri nets, colored timed Petri net, automatic generation

Cite this

Copy

Andrea Veronica PORCO, Ryosuke USHIJIMA, Morikazu NAKAMURA, "Automatic Generation of Mixed Integer Programming for Scheduling Problems Based on Colored Timed Petri Nets" in IEICE TRANSACTIONS on Fundamentals, vol. E101-A, no. 2, pp. 367-372, February 2018, doi: 10.1587/transfun.E101.A.367.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.367/_p

Copy

@ARTICLE{e101-a_2_367,
author={Andrea Veronica PORCO, Ryosuke USHIJIMA, Morikazu NAKAMURA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Automatic Generation of Mixed Integer Programming for Scheduling Problems Based on Colored Timed Petri Nets},
year={2018},
volume={E101-A},
number={2},
pages={367-372},
abstract={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.},
keywords={},
doi={10.1587/transfun.E101.A.367},
ISSN={1745-1337},
month={February},}

Copy

TY - JOUR
TI - Automatic Generation of Mixed Integer Programming for Scheduling Problems Based on Colored Timed Petri Nets
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 367
EP - 372
AU - Andrea Veronica PORCO
AU - Ryosuke USHIJIMA
AU - Morikazu NAKAMURA
PY - 2018
DO - 10.1587/transfun.E101.A.367
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2018
AB - 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.
ER -