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

DOI10.1080/01969729408902348zbMATH Open0821.90064OpenAlexW2009416539MaRDI QIDQ4698472FDOQ4698472

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• KBSS: A knowledge-based system for scheduling in automated manufacturing

Cited In (6)

• Title not available (Why is that?)
• Delay-Dependent Partial Order Reduction Technique for Time Petri Nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Near-Optimal Scheduling for Petri Net Models With Forbidden Markings
• Title not available (Why is that?)

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)