Synthesis of No-Wait Cyclic Schedules for Cascade-Like Systems of Repetitive Processes with Fixed Periods | SpringerLink
Skip to main content
Springer Nature Link
Log in

Synthesis of No-Wait Cyclic Schedules for Cascade-Like Systems of Repetitive Processes with Fixed Periods

  • Conference paper
  • First Online:
Information Systems Architecture and Technology: Proceedings of 40th Anniversary International Conference on Information Systems Architecture and Technology – ISAT 2019 (ISAT 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1051))

  • 671 Accesses

Abstract

The paper deals with the problem of synthesis of cyclic schedules for cascade-like topology repetitive systems that share resources using the mutual exclusion rule. Such processes are represented by, for example, repetitive transport tasks occurring in AGV systems, in which the carriages share sectors of routes belonging to neighboring manufacturing cells or cyclic operations carried out in urban transport systems such as train, subway, in which individual lines use shared hubs (i.e. inter-change stations, cross-platforms, etc.) combining mesh-like communication networks. In this context, the problem in question concerns determining the operation times of cascade-like repetitive processes and their start times, which guarantee the existence of a no-wait cyclic schedule of processes. An extended variant of the cascade-like system is considered, in which, in comparison to the classical “chain” model with two operations carried out as part of the process, each cyclic component process contains additional operations. The purpose of this work is to provide necessary and sufficient conditions for process operations and their start times to ensure that there is a cyclic schedule free of waiting for resources, and then apply the developed conditions in the synthesis procedure of the cascade-like system parameters.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 17159
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 21449
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

References

  1. Abadi, I.N.K., Hall, N.G., Sriskandarajah, C.: Minimizing cycle time in a blocking flowshop. Oper. Res. 48, 177–180 (2000)

    Article  MathSciNet  Google Scholar 

  2. AitZai, A., Benmedjdoub, B., Boudhar, M.: A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking. Int. J. Oper. Res. 14(3), 343–365 (2012)

    Article  MathSciNet  Google Scholar 

  3. Alpan, G., Jafari, M.A.: Dynamic analysis of timed Petri nets: a case of two processes and a shared resource. IEEE Trans. Robot. Autom. 13(3), 338–346 (1997)

    Article  Google Scholar 

  4. Alpan, G., Jafari, M.A.: Synthesis of sequential controller in the presence of conflicts and free choices. IEEE Trans. Robot. Autom. 14(3), 488–492 (1998)

    Article  Google Scholar 

  5. Allahverdi, A.: A survey of scheduling problems with no-wait in process. Eur. J. Oper. Res. 255(3), 665–686 (2016)

    Article  MathSciNet  Google Scholar 

  6. Aschauer, A., Roetzer, F., Steinboeck, A., Kugi, A.: An efficient algorithm for scheduling a flexible job shop with blocking and no-wait constraints. IFAC-PapersOnLine 50(1), 12490–12495 (2017). 20th IFAC World Congress

    Article  Google Scholar 

  7. Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.-P.: Synchronization and Linearity (An Algebra for Discrete State Systems). Wiley, Chichester (1992)

    MATH  Google Scholar 

  8. Banaszak, Z., Jędrzejek, K.: On self-synchronization of cascade-like coupled processes. Appl. Math. Comput. Sci. 3(4), 39–60 (1993)

    MATH  Google Scholar 

  9. Banaszak, Z., Krogh, B.: Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows. IEEE Trans. Robot. Autom. 6(6), 724–734 (1990)

    Article  Google Scholar 

  10. Bocewicz, G., Nielsen, I., Banaszak, Z.: Automated guided vehicles fleet match-up scheduling with production flow constraints. Eng. Appl. Artif. Intell. 30, 49–62 (2014)

    Article  Google Scholar 

  11. Bocewicz, G., Wójcik, R., Banaszak, Z., Pawlewski, P.: Multimodal processes rescheduling: cyclic steady states space approach. Math. Probl. Eng. (2013). http://dx.doi.org/10.1155/2013/407096

  12. Bożejko, W., Pempera, J., Wodecki, M.: Minimal cycle time determination and golf neighborhood generation for the cyclic flexible job shop problem. Bull. Pol. Acad. Sci. Tech. Sci. 66(3), 333–344 (2018)

    Google Scholar 

  13. Brucker, P., Kampmeyer, T.: Cyclic job shop scheduling problems with blocking. Ann. Oper. Res. 159(1), 161–181 (2008)

    Article  MathSciNet  Google Scholar 

  14. Gaujal, B., Jafari, M., Baykal, G.-M., Alpan, G.: Allocation sequences of two processes sharing a resource. IEEE Trans. Robot. Autom. 11(5), 748–753 (1995)

    Article  Google Scholar 

  15. Gold, E.: Deadlock prediction: easy and difficult cases. SIAM J. Comput. 7, 320–336 (1978)

    Article  MathSciNet  Google Scholar 

  16. Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44(3), 510–525 (1996)

    Article  MathSciNet  Google Scholar 

  17. Krenczyk, D., Kalinowski, K., Grabowik, C.: Integration production planning and scheduling systems for determination of transitional phases in repetitive production. In: Hybrid Artificial Intelligent Systems. LNCS, vol. 7209, pp. 274–283 (2012)

    Google Scholar 

  18. Kamoun, H., Sriskandarajah, C.: The complexity of scheduling jobs in repetitive manufacturing systems. Eur. J. Oper. Res. 70, 350–364 (1993)

    Article  Google Scholar 

  19. Kumar, S., Bagchi, T.P., Sriskandarajah, C.: Lot streaming and scheduling heuristics for m-machine no-wait flowshops. Comput. Ind. Eng. 38, 149–172 (2000)

    Article  Google Scholar 

  20. Lawley, M., Reveliotis, S.: Deadlock avoidance for sequential resource allocation systems: hard and easy cases. Int. J. Flex. Manuf. Syst. 13(4), 385–404 (2001)

    Article  Google Scholar 

  21. Levner, E., Kats, V., Alcaide, D., Pablo, L., Cheng, T.C.E.: Complexity of cyclic scheduling problems: a state-of-the-art survey. Comput. Ind. Eng. 59(2), 352–361 (2010)

    Article  Google Scholar 

  22. Liu, S.-Q., Kozan, E.: Scheduling trains with priorities: a no-wait blocking parallel-machine job-shop scheduling model. Transp. Sci. 45(2), 175–198 (2011)

    Article  Google Scholar 

  23. Louaqad, S., Kamach, O., Iguider, A.: Scheduling for job shop problems with transportation and blocking no-wait constraints. J. Theor. Appl. Inf. Technol. 96(10), 2782–2792 (2018)

    Google Scholar 

  24. Pinedo, M.: Planning and Scheduling in Manufacturing and Services. Springer, New York (2005)

    MATH  Google Scholar 

  25. Polak, M., Majdzik, P., Banaszak, Z., Wójcik, R.: The performance evaluation tool for auto-mated prototyping of concurrent cyclic processes. Fundamenta Informaticae 60(1–4), 269–289 (2004)

    MathSciNet  MATH  Google Scholar 

  26. Schuster, ChJ: No-wait job shop scheduling: tabu search and complexity of subproblems. Math. Methods Oper. Res. 63(3), 473–491 (2006)

    Article  MathSciNet  Google Scholar 

  27. Smutnicki, Cz.: Minimizing cycle time in the manufacturing system based on the flow of various jobs. IFAC Proc. 42(4), 1137–1142 (2009). 13th IFAC Symposium on Information Control Problems in Manufacturing

    Article  Google Scholar 

  28. Song, J.-S., Lee, T.-E.: Petri net modeling and scheduling for cyclic job shops with blocking. Comput. Ind. Eng. 34(2), 281–295 (1998)

    Article  Google Scholar 

  29. 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, New York (2007)

    Chapter  Google Scholar 

  30. Wójcik, R.: Designing a no-wait cyclic schedule for a class of concurrent repetitive production processes. IFAC-PapersOnLine 51(11), 1305–1310 (2018). Designing a no-wait cyclic schedule for a class of concurrent repetitive production processes

    Article  Google Scholar 

  31. Wójcik, R.: Towards strong stability of concurrent repetitive processes sharing resources. Syst. Sci. 27(2), 37–47 (2001)

    MathSciNet  Google Scholar 

  32. Von Kampmeyer, T.: Cyclic scheduling problems. Ph.D. dissertation, Mathematik/Informatik, Universität Osnabrück (2006)

    Google Scholar 

  33. Zaremba, M.B., Jędrzejek, K.J., Banaszak, Z.A.: Design of steady-state behavior of concurrent repetitive processes: an algebraic approach. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 28(2), 199–212 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Faculty of Electronics, Wrocław University of Science and Technology, Wrocław, Poland

    Robert Wójcik

  2. Department of Computer Science and Management, Koszalin University of Technology, Koszalin, Poland

    Grzegorz Bocewicz & Zbigniew Banaszak

Authors
  1. Robert Wójcik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grzegorz Bocewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zbigniew Banaszak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robert Wójcik .

Editor information

Editors and Affiliations

  1. Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Jerzy Świątek

  2. Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Leszek Borzemski

  3. University of Applied Sciences in Nysa, Nysa, Poland

    Zofia Wilimowska

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wójcik, R., Bocewicz, G., Banaszak, Z. (2020). Synthesis of No-Wait Cyclic Schedules for Cascade-Like Systems of Repetitive Processes with Fixed Periods. In: Świątek, J., Borzemski, L., Wilimowska, Z. (eds) Information Systems Architecture and Technology: Proceedings of 40th Anniversary International Conference on Information Systems Architecture and Technology – ISAT 2019. ISAT 2019. Advances in Intelligent Systems and Computing, vol 1051. Springer, Cham. https://doi.org/10.1007/978-3-030-30604-5_1

Download citation

Publish with us

Policies and ethics

Search

Navigation