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

DOI10.1080/01969729408902348MaRDI QIDQ4698472zbMATH OpenOpenAlexFDO

Authors Qin Chen, J. Y. S. Luh, Liying Shen

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

constraintsPetri netsbranch-and-boundprecedence relationshipsmultiple resource allocationmultirobot task scheduling

Mathematics Subject Classification ID

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

Recommendations

• Petri net based scheduling
• scientific article; zbMATH DE number 4074795
• scientific article; zbMATH DE number 3896317
• scientific article; zbMATH DE number 4074793
• FMS scheduling based on timed Petri net model and reactive graph search

Cites work

• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• KBSS: A knowledge-based system for scheduling in automated manufacturing
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I

Cited in

(6)

• scientific article; zbMATH DE number 5152608 (Why is no real title available?)
• scientific article; zbMATH DE number 3896317 (Why is no real title available?)
• scientific article; zbMATH DE number 4074795 (Why is no real title available?)
• Near-Optimal Scheduling for Petri Net Models With Forbidden Markings
• Delay-Dependent Partial Order Reduction Technique for Time Petri Nets
• scientific article; zbMATH DE number 2104635 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698472)