Scheduling analysis of FMS: an unfolding timed Petri nets approach

DOI10.1016/J.MATCOM.2005.11.010zbMath1098.90525OpenAlexW2039815284MaRDI QIDQ2489623

Ouajdi Korbaa, Jong-Kun Lee

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)

Related Items (1)

Cyclic scheduling in robotic flowshops with bounded work-in-process levels

Cites Work

• A technique of state space search based on unfolding
• Unnamed Item
• Unnamed Item
• Unnamed Item

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