Abstract
Cyclic scheduling problems are usually observed in FMSs producing multi-type parts where the AGVS plays a role of a material handling system as well as in other various multimodal transportation systems where goods and/or passenger itinerary planning plays a pivotal role. Schedulability analysis of concurrently flowing cyclic processes (SCCP) executed in these kind of systems can be considered using a declarative modeling framework. Consequently, the considered SCCP scheduling problem can be seen as a constraint satisfaction one. Assumed representation provides a unified way for performance evaluation of local cyclic as well as supported by them multimodal processes. The main question regards of a control procedure (e.g. a set of dispatching rules) guaranteeing a SCCP cyclic behavior. In this context, the sufficient conditions guaranteeing both local and multimodal processes schedulability are discussed and some recursive approach to their designing is proposed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bocewicz G, Banaszak Z (2013) Declarative approach to cyclic steady states space refinement: periodic processes scheduling. Int J Adv Manuf Technol Vol. 67, Issue 1–4, Springer, pp 137–155
Bocewicz G, Bach I, Banaszak Z (2009a) Logic-algebraic method based and constraints programming driven approach to AGVs scheduling. In. Int J Intell Inf Database Syst 3(1):56–74
Bocewicz G., Wójcik R., Banaszak Z (2009b) On undecidability of cyclic scheduling problems. In: Mapping relational databases to the semantic web with original meaning. Lecture Notes in Computer Science, LNCS, vol 5914. Springer, Berlin, pp 310–321
Bocewicz G, Wójcik R, Banaszak Z (2011a) Toward cycling scheduling of concurrent multimodal processes. In: Computational collective intelligence: technologies and applications. Lecture Notes in Artificial Intelligence, LNAI, vol 6922. Springer, Berlin, pp 448–457
Bocewicz G, Wójcik R, Banaszak Z (2011b) 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, Berlin, pp 191–198
Cai X, Li KN (2000) A genetic algorithm for scheduling staff of mixed skills under multi-criteria. Eur J Oper Res 125:359–369
Dang QV, Nielsen I, Steger-Jensen K (2011) Scheduling a single mobile robot for feeding tasks in a manufacturing cell. International conference advances in production management systems, Stavanger, Norway, 2011
Gaujal B, Jafari M, Baykal-Gursoy M, Alpan G (1995) Allocation sequences of two processes sharing a resource. IEEE Trans Robotics Autom 11(5):748–753
Guy RK (1994) Diophantine equations. Ch. D in unsolved problems in number theory, 2nd edn. Springer, New York, pp 139–198
Lawley MA, Reveliotis SA, Ferreira PM (1998) A correct and scalable deadlock avoidance policy for flexible manufacturing systems. IEEE Trans Robotics Autom 14(5):796–809
Levner E, Kats V, Alcaide D, Pablo L, Cheng TCE (2010) Complexity of cyclic scheduling problems: a state-of-the-art survey. Comput Ind Eng 59(2):352–361
Liebchen C, Möhring RH (2002) A case study in periodic timetabling. Electron Notes Theor Comput Sci 66(6):21–34
Pinedo ML (2005) Planning and scheduling in manufacturing and services. Springer, New York
Polak M, Majdzik P, Banaszak Z, Wójcik R (2004) The performance evaluation tool for automated prototyping of concurrent cyclic processes. Fundamenta Informaticae 60(1-4):269–289
Schulte CH, Smolka G, Wurtz J (1998) Finite domain constraint programming in Oz, DFKI OZ documentation series, German Research Center for Artificial Intelligence, Saarbrucken, Germany, 1998
Smart Nigiel P (1998) The algorithmic resolution of Diophantine equations. London Mathematical Society Student Text, 41. Cambridge University Press, Cambridge
Song J-S, Lee T-E (1998) Petri net modeling and scheduling for cyclic job shops with blocking. Comput Ind Eng 34(2):281–295
Steger-Jensen K, Hvolby HH, Nielsen P, Nielsen I (2011) Advanced planning & scheduling technology. Prod. Plan Control 22(8):800–808
Trouillet B, Korbaa O, Gentina J-CK (2007) Formal approach for FMS cyclic scheduling. IEEE SMC Trans Part C 37(1):126–137
Von Kampmeyer T (2006) Cyclic scheduling problems. Ph.D. dissertation, Fachbereich Mathematik/Informatik, Universität Osnabrück
Wang B, Yang H, Zhang Z-H (2007) Research on the train operation plan of the Beijing-Tianjin inter-city railway based on periodic train diagrams. Tiedao Xuebao/J China Railway Soc 29(2):8–13
Wójcik R (2007) Constraint programming approach to designing conflict-free schedules for repetitive manufacturing processes. In: Cunha PF, Maropoulos PG (eds) Digital enterprise technology. Perspectives and future challenges. Springer, New York, pp 267–274
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bocewicz, G. (2014). Reachability of Multimodal Processes Cyclic Steady States Space. In: Golinska, P. (eds) Environmental Issues in Automotive Industry. EcoProduction. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23837-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-23837-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23836-9
Online ISBN: 978-3-642-23837-6
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)