Time-Feasible Reachability Tree for Noncyclic Scheduling of Timed Petri Nets

@article{Kim2015TimeFeasibleRT,
  title={Time-Feasible Reachability Tree for Noncyclic Scheduling of Timed Petri Nets},
  author={Hyun-Jung Kim and Jun-Ho Lee and Tae-Eog Lee},
  journal={IEEE Transactions on Automation Science and Engineering},
  year={2015},
  volume={12},
  pages={1007-1016}
}
Petri nets are useful for modeling and analyzing complex scheduling problems of automated manufacturing systems, such as robotized cluster tools for semiconductor manufacturing and robot cells with diverse and complex tool architectures and scheduling requirements. While there are many scheduling works on cyclic operation cycles of such systems and their Petri net models, automated manufacturing systems have significant noncyclic operation cycles. For instance, cluster tools cannot repeat… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

Scheduling Cluster Tools in Semiconductor Manufacturing: Recent Advances and Challenges

  • IEEE Transactions on Automation Science and Engineering
  • 2018
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Scheduling Dual-Armed Cluster Tools With Chamber Cleaning Operations

  • IEEE Transactions on Automation Science and Engineering
  • 2018
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND

Scheduling Single-Armed Cluster Tools With Chamber Cleaning Operations

  • IEEE Transactions on Automation Science and Engineering
  • 2018
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS

Completion Time Analysis for Automated Manufacturing Systems with Parallel Processing Modules

  • 2018 IEEE International Conference on Robotics and Automation (ICRA)
  • 2018
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 45 REFERENCES

Timed Petri net schedules

  • European Workshop on Applications and Theory of Petri Nets
  • 1987
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Noncyclic Scheduling of Cluster Tools With a Branch and Bound Algorithm

  • IEEE Transactions on Automation Science and Engineering
  • 2015
VIEW 9 EXCERPTS

Non-Cyclic Scheduling of a Wet Station

  • IEEE Transactions on Automation Science and Engineering
  • 2014
VIEW 10 EXCERPTS

A petri net-based modeling and scheduling with a branch and bound algorithm

  • 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC)
  • 2012
VIEW 10 EXCERPTS

Petri net scheduling of FMS using branch and bound method

  • Proceedings of IECON '95 - 21st Annual Conference on IEEE Industrial Electronics
  • 1995
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Scheduling flexible manufacturing systems using Petri nets and heuristic search

  • IEEE Trans. Robotics and Automation
  • 1994
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL