Hybrid search algorithm to optimize scheduling problems for TCPN models
Miguel Mújica Mota, Miquel Àngel Piera · Summer Computer Simulation Conference · 2010
Scheduling of manufacturing or logistic processes takes high importance as a key factor to improve competitiveness in industrial systems. The state space analysis of Timed Coloured Petri Nets is an accepted simulation-optimization approach which suffers from the state explosion problem which makes difficult to develop approaches that ensure optimality when used as an optimization approach. In this paper it is presented an approach which is a hybrid from depth-first search approaches with a time line approach. The algorithm first finds a feasible path and afterwards it re-evaluates the state space in a time driven basis in order to improve its efficiency for finding optimal values of the model when time is used as the cost function.