Art

J-GLOBAL ID：201502208633608830   Reference number：15A0546080

Petri Net Based Approaches to Scheduling Problems

ペトリネットに基づくスケジューリング問題へのアプローチ

Author (1)： NAKAMURA MORIKAZU (琉球大学工学部情報工学科)
Material： Fundamentals Review (Web)  (Fundam Rev (Web))
Volume： 8  Issue： 4  Page： 314-321 (J-STAGE)  Publication year： 2015 
JST Material Number： U0221A  ISSN： 1882-0875  Document type： Article
Article type： 解説  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： *Petri net ,  *scheduling ,  production management ,  job shop scheduling ,  flow shop scheduling ,  method of solution ,  Saccharum officinarum ,  mathematical programming ,  production
Semi thesaurus term： production scheduling ,  Parallel machine scheduling ,  agricultural production

JST classification (2)： Process control  (KB03030P) ,  Agricultural economy,agricultural management  (FB01020L)

Reference (15)：

• (1) W. M. P. van der Aalst, “Petri net based scheduling,” Operations-Research-Spektrum, vol.18, no.4, pp.219-229, 1996.
• (2) Mušič, Ga?ssper, “Schedule optimization based on coloured Petri nets and local search,” Proc. of the 7th Vienna International Conference on Mathematical Modelling, Mathematical Modelling , vol.7, Part 1, pp.352-357, 2002.
• (3) M.A. Piera and G. Mušič, “Coloured Petri net scheduling models: Timed state space exploration shortages,” Math. Comput. Simul., vol.82, no.3, pp.428-441, 2011.
• (4) T. Murata, “Petri nets: Properties, analysis and applications,” Proc., vol. 77, pp. 541-580, 1989.
• (5) C. Bellettini and C. Lorenzo, “Reachability analysis of time basic Petri nets: A time coverage approach,” Proc. of 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp.110-117, 2011.

Terms in the title (2)： ペトリネット ,  スケジューリング