An extended event graph with negative places and tokens for time window constraints

IEEE Transactions on Automation Science and Engineering

Volumn 2, Issue 4, 2005, Pages 319-332

  Lee, Tae Eog ^a   Park, Seong Ho ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Discrete event system; Negative place; Negative token; Petri net; Time window constraint

Indexed keywords

DISCRETE TIME CONTROL SYSTEMS; INTEGRATED CIRCUITS; ROBOTS; SEMICONDUCTOR DEVICE MANUFACTURE;

NEGATIVE PLACE; NEGATIVE TOKENS; ROBOT-BASED CLUSTER TOOLS; TIME WINDOW CONSTRAINTS;

GRAPH THEORY;

EID: 27644434964     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2005.851236     Document Type: Article

References (19)

1. Y.-H. Shin, T.-E. Lee, J.-H. Kim, and H.-Y. Lee, "Modeling and implementing a real-time scheduler for dual-armed cluster tools," Comput. Ind., vol. 45, no. 1, pp. 13-27, 2001.
2. H. Chen, C. Chu, and J.-M. Proth, "Cyclic scheduling of a hoist with time window constraints," IEEE Trans. Robot. Autom., vol. 14, no. 1, pp. 144-152, Feb. 1998.
3. L. Lei and Q. Liu, "Optimal cyclic scheduling of a robotic processing line with two-product and time-window constraints," INFOR, vol. 39, no. 2, pp. 185-199, 2001.
4. J.-W. Seo and T.-E. Lee, "Steady state analysis and scheduling of cyclic job shops with overtaking," Int. J. Flex. Manuf. Syst., vol. 14, no. 4, pp. 291-318, 2002.
5. E. V. Levner and A. S. Nemirovsky, "A network flow algorithm for just-in-time project scheduling," Eur. J. Oper. Res., vol. 79, no. 2, pp. 167-175, 1994.
6. E. V. Levner and V. Kats, "A parametric critial path problem and an application for cyclic scheduling," Discr. Appl. Math., vol. 87, no. 1, pp. 149-158, 1998.
7. W. Khansa, P. Aygalinc, and J.-P. Denat, "Structural analysis of p-time Petri nets," in Proc. CESA '96, Jul. 1996, pp. 127-136.
8. J.-H. Kim, T.-E. Lee, H.-Y. Lee, and D.-B. Park, "Scheduling analysis of time-constrained dual-armed cluster tools," IEEE Trans. Semicond. Manuf., vol. 16, pp. 521-534, 2003.
9. W. M. P. van der Aalst, "Interval timed colored Petri net and their analysis," in Lecture Notes in Computer Science. New York: Springer-Verlag, 1993, pp. 453-472.
10. T. Murata and H. Yamaguchi, "A Petri net with negative tokens and its application to automated reasoning," in Proc. 33rd Midwest Symp. Circuits and Systems, Calgary, QC, Canada, 1990, pp. 762-765.
11. T. Murata, "Petri nets: Properties, analysis and applications," Proc. IEEE, vol. 77, no. 3, pp. 541-580, Mar. 1989.
12. J. Wang, Timed Petri Nets. Boston, MA: Kluwer, 1998.
13. F. L. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat, Synchronization and Linearity. New York: Wiley, 1992.
14. R. M. Karp and J. B. Orlin, "Parametric shortest path algorithms with an application to cyclic staffing," Discr. Appl. Math., vol. 3, no. 1, pp. 37-45, 1981.
15. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1993.
16. T.-E. Lee, "Stable earliest starting schedules for cyclic job shops: A linear system approach," Int. J. Flex. Manuf. Syst., vol. 12, no. 1, pp. 59-80, 2000.
17. T.-E. Lee and M. E. Posner, "Performance measures and schedules in periodic job shops," Oper. Res., vol. 45, no. 1, pp. 72-91, 1997.
18. G. B. Danzig, W. O. Blattner, and M. R. Rao, "Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem," in Theory of Graphs, P. Rosenstiehl, Ed. New York: Gordon and Breach, 1966, pp. 77-83.
19. K. Murty, Linear and Combinatorial Programming. New York: Wiley, 1976.