Login / Signup

Time-Feasible Reachability Tree for Noncyclic Scheduling of Timed Petri Nets.

Hyun-Jung KimJun-Ho LeeTae-Eog Lee
Published in: IEEE Trans Autom. Sci. Eng. (2015)
Keyphrases
  • timed petri nets
  • discrete event systems
  • scheduling problem
  • scheduling algorithm
  • artificial intelligence
  • search space
  • neural network
  • reinforcement learning