Discrete Event Dynamic Systems

, Volume 29, Issue 3, pp 393–409 | Cite as

Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling

  • Michael Ibrahim
  • Spyros ReveliotisEmail author
Part of the following topical collections:
  1. Smart Manufacturing - A New DES Frontier


Fluid-relaxation-based scheduling is a powerful scheduling method for complex resource allocation systems and other stochastic networks. However, this method has been pursued through rather ad hoc representations and arguments in the past. This paper establishes that timed-continuous Petri nets provide a structured and natural framework for the implementation of this method in the context of complex resource allocation, and highlights the potential advantages of such a more structured approach.


Scheduling of complex resource allocation systems Fluid-relaxation-based scheduling Petri-net-based modeling and analysis of Discrete Event Systems 



  1. Ajmone Marsan M, Balbo G, Conte G, Donatelli S, Franceschinis G (1994) Modeling with Generalized Stochastic Petri Nets. Wiley, New YorkzbMATHGoogle Scholar
  2. Balduzzi F, Giua A, Menga G (2000) First-order hybrid P,etri nets: a model for optimization and control. IEEE Trans Robot Autom 16:382–399CrossRefGoogle Scholar
  3. Balduzzi F, Di Febbraro A (2001) Combining fault detection and process optimization in manufacturing systems using first-order hybrid Petri nets. Inproceedings of ICRA 2001. IEEE, pp 40–45Google Scholar
  4. Bertsekas DP (2012) Dynamic Programming and Optimal Control, vol 2, 4th edn. Athena Scientific, BelmontGoogle Scholar
  5. Bertsimas D, Nasrabadi E, Paschalidis I. C. h. (2015) Robust fluid processing networks. IEEE Trans Autom Control 60:715–728MathSciNetCrossRefGoogle Scholar
  6. Cavone G, Dotoli M, Seatzu C (2016) Management of intermodal freight terminals by first-order hybrid Petri nets. IEEE Robot Autom Lett 1:2–9CrossRefGoogle Scholar
  7. Choi JY, Reveliotis S (2003) A generalized stochastic P,etri net model for performance analysis and control of capacitated re-entrant lines. IEEE Trans Robot Autom 19:474–480CrossRefGoogle Scholar
  8. Dai JG, Vande Vate JH (2000) The stability od two-station multitype fluid networks. Oper Res 48:721–744MathSciNetCrossRefGoogle Scholar
  9. Dotoli M, Fanti MP, Iacobellis G, Mangini AM (2009) A first-order hybrid Petri net model for supply chain management. IEEE Trans Autom Sci Eng 6:744–758CrossRefGoogle Scholar
  10. Giua A, DiCesare F, Silva M (1992) Generalized mutual exclusion constraints on nets with uncontrollable transitions. In: Proceedings of the 1992 IEEE Intl. Conference on Systems, Man and Cybernetics. IEEE, pp 974–979Google Scholar
  11. Hu H, Zhou M, Li Z (2012) Liveness and ratio-enforcing supervision of automated manufacturing systems using Petri nets. IEEE Trans Syst Man Cybern – Part A: Syst Hum 42:392–403CrossRefGoogle Scholar
  12. Ibrahim M (2019) Scheduling Techniques for Complex Resource Allocation Systems. PhD thesis, ISye, Georgia Tech, AtlantaGoogle Scholar
  13. Ibrahim M, Reveliotis S (2018) Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling Technical report, ISyE, Georgia TechGoogle Scholar
  14. Ibrahim M, Reveliotis S (2019) Throughput maximization of capacitated re-entrant lines through fluid relaxation. IEEE Trans Autom Sci Eng 16:792–810CrossRefGoogle Scholar
  15. Li R, Reveliotis S (2015) Performance optimization for a class of generalized stochastic Petri nets. Discret Event Dyn Syst: Theory Appl 25:387–417MathSciNetCrossRefGoogle Scholar
  16. Li R, Reveliotis S (2016) Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory. Discret Event Dyn Syst: Theory Appl 26:511–537MathSciNetCrossRefGoogle Scholar
  17. Mahulea C (2007) Timed Continuous Petri Nets:Quantitative Analysis, Observability and Control. PhD thesis, Universidad de Zaragoza, ZaragozaGoogle Scholar
  18. Moody JO, Antsaklis PJ (1998) Supervisory Control of Discrete Event Systems using Petri nets. Kluwer Academic Pub, BostonGoogle Scholar
  19. Puterman ML (1994) Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New YorkCrossRefGoogle Scholar
  20. Recalde L, Teruel E, Sliva M (1999) Autonomous continuous P/T systems. In: Applications and Theory of Perti Nets 1999, pp 107–126Google Scholar
  21. Reveliotis S (2017) Logical Control of Complex Resource Allocation Systems. NOW Ser Found Trends Syst Control 4:1–224CrossRefGoogle Scholar
  22. Reveliotis S (2000) The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks. IEEE Trans Autom Control 45:585–588MathSciNetCrossRefGoogle Scholar
  23. Silva M, Teruel E, Colom JM (1998) Linear algebraic and linear programming techniques for the analysis of place/transition net systems. In: Reisig W, Rozenberg G (eds) Lecture Notes in Computer Science, vol 1491. Springer, Berlin, pp 309–373Google Scholar
  24. Weiss G (2000) Scheduling and control of manufacturing systems - a fluid approach. In: Proceedings of the 37th Allerton Conference. University of Illinois, pp –Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.School of Industrial & Systems EngineeringGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations