Generation Filtered Beam Search algorithm for the scheduling of hybrid FMS using T-TPN
Ghassen Cherif, Edouard Leclercq, Dimitri Lefebvre · 2019
This paper is about the incremental computation of control sequences for complex discrete event systems (DES). Transition-timed Petri nets (T-TPNs) that behave under earliest firing policy are used to model hybrid FMS that has some operations with total precedence constraints and other operations with full routing flexibility. The objective is to find a control sequence from an initial state to a reference one in minimal time. For that, a cost function is proposed and used with a new variant of beam search method that selectively explores the PN state space.