6B1 DECOMPOSITION OF PETRI NETS FOR SOLVING GENERAL SCHEDULING PROBLEMS(Technical session 6B: General model for scheduling and assignment problem)
スポンサーリンク
概要
- 論文の詳細を見る
Motivated by the need to develop general optimization models, the recent integration of Petri nets as modeling tools into effective optimization methods for scheduling problems is very promising. Following these issues, the optimization problems to determine a legal firing vector to minimize a given objective function are also NP-hard. The paper addresses a general decomposition model for Petri nets to represent a wide variety of scheduling problems and a decomposition method to obtain near-optimal solution with reasonable computation time. The approach is applied to a routing problem for multiple Automated Guided Vehicles (AGVs) and a flowshop scheduling problem. The performance of the proposed algorithm is compared with conventional methods.
- 一般社団法人日本機械学会の論文
- 2006-07-18
著者
-
Konishi Masami
Graduate School Of Natural Science And Technology Okayama University
-
Nishi Tatsushi
Graduate School of Engineering Science Osaka University
-
Maeno Ryota
Graduate School of Natural Science and Technology Okayama University
関連論文
- 6B1 DECOMPOSITION OF PETRI NETS FOR SOLVING GENERAL SCHEDULING PROBLEMS(Technical session 6B: General model for scheduling and assignment problem)
- 5A2 SIMULTANEOUS OPTIMIZATION OF STORAGE ALLOCATION AND ROUTING PROBLEMS FOR BELT-CONVEYOR TRANSPORTATION(Technical session 5A: Application and practice 2)