Petri Net Modeling and Decomposition Method for Solving Production Scheduling Problems
Petri Net Modeling and Decomposition Method for Solving Production Scheduling Problems
复制标题
DOI：
10.1299/jamdsm.1.262
复制
发表时间：
2007
影响因子：
0.9
通讯作者：
T. Nishi;R. Maeno
中科院分区：
文献类型：
--
作者：
T. Nishi;R. Maeno
考虑到开发通用调度问题求解器的需要，最近将Petri网作为建模工具集成到调度问题的有效优化方法中是很有前景的。本文提出了一种Petri网建模和分解方法，用于求解各种调度问题。将调度问题表示为定时Petri网的最优过渡发射序列问题。将Petri网分解为若干个子问题，每个子问题都可以用Dijkstra算法求解。将该方法应用于一个流水车间调度问题。将该算法的性能与模拟退火方法进行了比较。
Considering the need to develop general scheduling problem solver, the recent integration of Petri Nets as modeling tools into effective optimization methods for scheduling problems is very promising. The paper addresses a Petri Net modeling and decomposition method for solving a wide variety of scheduling problems. The scheduling problems are represented as the optimal transition firing sequence problems for timed Petri Nets. The Petri Net is decomposed into several subnets in which each subproblem can be easily solved by Dijkstra' algorithm. The approach is applied to a flowshop scheduling problem. The performance of the proposed algorithm is compared with that of a simulated annealing method.