COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION

DOI10.1080/01969729408902348zbMath0821.90064OpenAlexW2009416539MaRDI 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

zbMATH Keywords

branch-and-boundPetri netsconstraintsprecedence relationshipsmultiple resource allocationmultirobot task scheduling

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• KBSS: A knowledge-based system for scheduling in automated manufacturing
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I

This page was built for publication: COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION