Petri Net based Mathematical Programming for Optimal Resource Assignment Problems with Multiple Resource Requirements
Tomoya Uchihara, Morikazu Nakamura · 2021
This paper presents a mixed-integer linear programming (MILP) generation based on colored timed Petri nets for optimal resource assignment problems. As a target system, we treat a system of sequential processes with shared resources, where processes simultaneously require multiple resources for their processing. This paper extends an MILP generation algorithm for systems of multiple sequential processes with a single resource requirement. Our method can systematically generate MILP instances from timed colored Petri net models; that is, we can improve the usability of mathematical programming for practical resource assignment problems.