Robustness analysis of Petri-net-based planning models in sequence space

MaRDI QIDQ3116965zbMATH OpenFDO

Authors Matthias Hüsig

Publication date 15 February 2012

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Transportation, logistics and supply chain management (90B06) Production models (90B30) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 978517
• scientific article; zbMATH DE number 978518
• Workshop scheduling using practical (inaccurate) data Part 2: An investigation of the robustness of scheduling rules in a dynamic and stochastic environment
• Production management in a Petri net environment
• FMS scheduling based on timed Petri net model and reactive graph search

Cited in

(3)

• Planning without state space explosion: Petri net to Markov decision process
• Robot Planning Based on Boolean Specifications Using Petri Net Models
• Robustness analysis of non-ordinary Petri nets for flexible assembly systems

This page was built for publication: Robustness analysis of Petri-net-based planning models in sequence space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3116965)