COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION
From MaRDI portal
Publication:4698472
DOI10.1080/01969729408902348zbMath0821.90064MaRDI QIDQ4698472
Liying Shen, Qin Chen, J. Y. S. Luh
Publication date: 4 May 1995
Published in: Cybernetics and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01969729408902348
branch-and-bound; Petri nets; constraints; precedence relationships; multiple resource allocation; multirobot task scheduling
90B15: Stochastic network models in operations research
90B35: Deterministic scheduling theory in operations research
Cites Work