Skip to main content

Rescheduling of Concurrently Flowing Cyclic Processes

  • Conference paper
Computational Collective Intelligence. Technologies and Applications (ICCCI 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7654))

Included in the following conference series:

  • 1101 Accesses

Abstract

The paper presents a declarative modeling framework enabling to evaluate the cyclic steady state of a given system of concurrently flowing cyclic processes (SCCP) on the base of the assumed topology of transportation routes, dispatching rules employed, resources and operation times as well as an initial processes allocation. The objective is to provide sufficient conditions guaranteeing rescheduling among cyclic schedules reachable in a given SCCP. The properties providing such conditions as well as illustrative examples are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  Google Scholar 

  2. Bocewicz, G., Banaszak, Z.: Declarative approach to cyclic scheduling of multimodal processes. In: Golińska, P. (ed.) EcoProduction and Logistics, vol. 1. Springer (2012)

    Google Scholar 

  3. Fournier, O., Lopez, P., Lan Sun Luk, J.-D.: 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 

  4. Levner, E., Kats, V., de Pablo, D.A.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)

    Article  Google Scholar 

  5. Liebchen, C., Möhring, R.H.: A case study in periodic timetabling. Electronic Notes in Theoretical Computer Science 66(6), 21–34 (2002)

    Article  Google Scholar 

  6. Polak, M., Majdzik, P., Banaszak, Z., Wójcik, R.: The performance evaluation tool for automated prototyping of concurrent cyclic processes. Fundamenta Informaticae 60(1-4), 269–289 (2004); ISO Press, Editor-in-Chief, Skowron, A.

    MathSciNet  MATH  Google Scholar 

  7. Wójcik, R.: Constraint programming approach to designing conflict-free schedules for repetitive manufacturing processes. In: Cunha, P.F., Maropoulos, P.G. (eds.) Digital Enterprise Technology. Perspectives and Future Challenges, pp. 267–274. Springer (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bocewicz, G., Banaszak, Z.A. (2012). Rescheduling of Concurrently Flowing Cyclic Processes. In: Nguyen, NT., Hoang, K., JÈ©drzejowicz, P. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2012. Lecture Notes in Computer Science(), vol 7654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34707-8_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34707-8_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34706-1

  • Online ISBN: 978-3-642-34707-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics