Advertisement

Declarative Approach to Cyclic Scheduling of Multimodal Processes

  • Grzegorz Bocewicz
  • Zbigniew A. Banaszak
Chapter
Part of the EcoProduction book series (ECOPROD)

Abstract

In this chapter, we deal with the cyclic scheduling problem usually observed in the FMS producing multi-type parts where the AGVS plays a role of a material handling system. Finding the conditions guaranteeing the AGVs deadlock-free and collision-free movement policy is the aim of this work. The AGVs co-sharing the common parts of the transportation route while executing repetitive processes, can be modeled in terms of Cyclic Concurrent Process Systems (CCPSs). The chapter suggests a novel approach for schedulability analysis employing the declarative modeling. In turn, the schedulability analysis for a given CCPS answers the question whether a cyclic schedule exists or not. A reference model of constraint satisfaction cyclic scheduling problem shows that unschedulability can be caused by a relation among an initial state and dispatching rules selected. The sufficient conditions guaranteeing CCPS schedulability are discussed and the recursive approach to their designing is proposed. Possible implementations are illustrated on example of the flexible manufacturing system operation.

Keywords

Cyclic behavior Cyclic scheduling Multimodal process Constraint satisfaction problem Declarative modeling 

References

  1. Alpan G, Jafari MA (1997) Dynamic analysis of timed Petri nets: a case of two processes and a shared resource. IEEE Trans Robot Autom 13(3):338–346Google Scholar
  2. Bocewicz G, Bach I, Banaszak Z (2009) Logic-algebraic method based and constraints programming driven approach to AGVs scheduling. Int J Intell Inform Database Sys 3(1)56–74Google Scholar
  3. Bocewicz G, Banaszak Z, Wójcik R (2007) Design of admissible schedules for AGV systems with constraints: a logic-algebraic approach. Lecture Notes in Artificial Intelligence, vol 4496. Springer, pp 578–587Google Scholar
  4. Bocewicz G, Wójcik R, Banaszak Z (2011) Cyclic steady state refinement. In: Abraham A, Corchado JM, Rodríguez González S, de Paz Santana JF (eds) International symposium on distributed computing and artificial intelligence, Series: Advances in Intelligent and Soft Computing, vol 91. Springer, pp 191–198Google Scholar
  5. Bocewicz G, Wójcik R, Banaszak Z (2009) On undecidability of cyclic scheduling problems. Mapping relational databases to the semantic web with original meaning. Lecture Notes in Computer Science. LNAI, Springer, vol 5914, pp 310–321Google Scholar
  6. Cai X, Li KN (2000) A genetic algorithm for scheduling staff of mixed skills under multi-criteria. Eur J Oper Res 125:359–369Google Scholar
  7. Gaujal B, Jafari M, Baykal-Gursoy M, Alpan G (1995) Allocation sequences of two processes sharing a resource. IEEE Trans Robot Autom 11(5):748–353Google Scholar
  8. Guy RK (1994) Diophantine equations. Ch. D in unsolved problems in number theory, 2nd edn. Springer, New York, pp 139–198Google Scholar
  9. Lawley MA, Reveliotis SA, Ferreira PM (1998) A correct and scalable deadlock avoidance policy for flexible manufacturing systems. IEEE Trans Robot Autom 14(5):796–809Google Scholar
  10. Levner E, Kats V, Alcaide D, Pablo L, Cheng TCE (2010) Complexity of cyclic scheduling problems: a state-of-the-art survey. Comp Ind Eng 59(2):352–361Google Scholar
  11. Liebchen C, Möhring RH (2002) A case study in periodic timetabling. Electron Notes Theor Comp Sci 66(6):21–34Google Scholar
  12. Pinedo ML (2005) Planning and scheduling in manufacturing and services. Springer, New YorkGoogle Scholar
  13. Polak M, Majdzik P, Banaszak Z, Wójcik R (2004) The performance evaluation tool for automated prototyping of concurrent cyclic processes. Fundam Inform, ISO Press, 60(1–4):269–289Google Scholar
  14. Schulte CH, Smolka G, Wurtz J (1998) Finite domain constraint programming in Oz, DFKI OZ documentation series. German Research Center for Artificial Intelligence, Saarbrucken, GermanyGoogle Scholar
  15. Smart Nigiel P (1998) The algorithmic resolution of diophantine equations. London mathematical society student text, vol 41. Cambridge University Press, CambridgeGoogle Scholar
  16. Song J-S, Lee T-E (1998) Petri net modeling and scheduling for cyclic job shops with blocking. Comp Ind Eng 34(2):281–295Google Scholar
  17. Von Kampmeyer T (2006) Cyclic scheduling problems, Ph.D. Dissertation, Fachbereich Mathematik/ Informatik, Universität OsnabrückGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Department of Electronics and Computer ScienceKoszalin University of TechnologyKoszalinPoland
  2. 2.Faculty of Management, Department of Business InformaticsWarsaw University of TechnologyWarsawPoland

Personalised recommendations