Scheduling analysis of FMS: an unfolding timed Petri nets approach

DOI10.1016/J.MATCOM.2005.11.010MaRDI QIDQ2489623zbMATH OpenOpenAlexFDO

Authors Jong-Kun Lee, Ouajdi Korbaa

Publication date 28 April 2006

Published in Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.matcom.2005.11.010

zbMATH Keywords

UnfoldingSlicesFMSTransitive matrixCyclic schedule

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Recommendations

• Two FMS scheduling methods based on Petri nets: A global and a local approach
• Timed Petri nets in modeling and analysis of simple schedules for manufacturing cells
• FMS scheduling based on timed Petri net model and reactive graph search
• Scheduling flexible manufacturing system based on timed Petri net and heuristic search
• Deadlock-free scheduling in flexible manufacturing systems using Petri nets

Cites work

• scientific article; zbMATH DE number 4092766 (Why is no real title available?)
• scientific article; zbMATH DE number 176521 (Why is no real title available?)
• scientific article; zbMATH DE number 978518 (Why is no real title available?)
• A technique of state space search based on unfolding

Cited in

(4)

• Cyclic scheduling in robotic flowshops with bounded work-in-process levels
• scientific article; zbMATH DE number 5499378 (Why is no real title available?)
• scientific article; zbMATH DE number 5831915 (Why is no real title available?)
• Two FMS scheduling methods based on Petri nets: A global and a local approach

This page was built for publication: Scheduling analysis of FMS: an unfolding timed Petri nets approach

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