A Branch and Bound Algorithm for Cyclic Scheduling of Timed Petri Nets.
Chihyun JungHyun-Jung KimTae-Eog LeePublished in: IEEE Trans Autom. Sci. Eng. (2015)
Keyphrases
- branch and bound algorithm
- cyclic scheduling
- timed petri nets
- discrete event systems
- lower bound
- material handling
- branch and bound
- upper bound
- scheduling problem
- np hard
- mathematical modeling
- optimal solution
- petri net
- combinatorial optimization
- precedence constraints
- lagrangian relaxation
- discrete event
- single machine scheduling problem
- upper bounding
- model based diagnosis
- telecommunication networks
- dynamical systems
- finding an optimal solution
- flowshop
- mathematical model
- search algorithm