Multimodal Processes Rescheduling

  • Grzegorz Bocewicz
  • Zbigniew A. Banaszak
  • Peter Nielsen
  • Quang-Vinh Dang
Conference paper
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 397)


Cyclic scheduling problems concerning multimodal processes are usually observed in FMSs producing multi-type parts where the Automated Guided Vehicles System (AGVS) plays a role of a material handling system. Schedulability analysis of concurrently flowing cyclic processes (SCCP) executed in these kinds of systems can be considered using a declarative modeling framework. Proposed representation provides a unified way for performance evaluation of local cyclic as well as supported by them multimodal processes. The main question regards of reachability of a SCCP cyclic behavior. In this context, the sufficient conditions guarantee the reachability of both local and multimodal processes cyclic steady state spaces are discussed.


Cyclic Process Cyclic Behavior Automate Guide Vehicle Transportation Route Material Handling System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Alpan, G., Jafari, M.A.: Dynamic analysis of timed Petri nets: a case of two processes and a shared resource. IEEE Trans. on Robotics and Automation 13(3), 338–346 (1997)CrossRefGoogle Scholar
  2. 2.
    Bocewicz, G., Banaszak, Z.: Declarative approach to cyclic scheduling of multimodal processes. In: Golińska, P. (ed.) EcoProduction and Logistics, vol. 1, pp. 203–235. Springer (2013)Google Scholar
  3. 3.
    Bocewicz, G., Banaszak, Z.: Declarative approach to cyclic steady states space refinement: periodic processes scheduling. International Journal of Advanced Manufacturing Technology (2012) (in print) Google Scholar
  4. 4.
    Bocewicz, G., Wójcik, R., Banaszak, Z.A.: Cyclic Steady State Refinement. In: Abraham, A., Corchado, J.M., González, S.R., De Paz Santana, J.F. (eds.) International Symposium on Distributed Computing and Artificial Intelligence. AISC, vol. 91, pp. 191–198. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  5. 5.
    Fournier, O., Lopez, P.: Cyclic scheduling following the social behavior of ant colonies. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp. 450–454 (2002)Google Scholar
  6. 6.
    Levner, E., Kats, V., Alcaide, D., Pablo, L., Cheng, T.C.E.: Complexity of cyclic scheduling problems: A state-of-the-art survey. Computers and Industrial Engineering 59(2), 352–361 (2010)CrossRefGoogle Scholar
  7. 7.
    Liebchen, C., Möhring, R.H.: A case study in periodic timetabling. Electronic Notes in Theoretical Computer Science 66(6), 21–34 (2002)CrossRefGoogle Scholar
  8. 8.
    Polak, M., Majdzik, P., Banaszak, Z., Wójcik, R.: The performance evaluation tool for automated prototyping of concurrent cyclic processes. In: Skowron, A. (ed.) Fundamenta Informaticae, vol. 60(1-4), pp. 269–289. ISO Press (2004)Google Scholar
  9. 9.
    Smart Nigiel, P.: The Algorithmic Resolution of Diophantine Equations. London Mathematical Society Student Text, vol. 41. Cambridge University Press, Cambridge (1998)CrossRefGoogle Scholar
  10. 10.
    Wójcik, R.: Constraint programming approach to designing conflict-free schedules for repetitive manufacturing processes. Digital enterprise technology. In: Cunha, P.F., Maropoulos, P.G. (eds.) Perspectives and Future Challenges, pp. 267–274. Springer (2007)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2013

Authors and Affiliations

  • Grzegorz Bocewicz
    • 1
  • Zbigniew A. Banaszak
    • 2
  • Peter Nielsen
    • 3
  • Quang-Vinh Dang
    • 3
  1. 1.Dept. of Electronics and Computer ScienceKoszalin University of TechnologyPoland
  2. 2.Faculty of Management, Dept. of Business InformaticsWarsaw University of TechnologyPoland
  3. 3.Dept. of Mechanical and Manufacturing EngineeringAalborg UniversityDenmark

Personalised recommendations