Abstract
This paper describes a multimodal transportation network (MTN) in which several unimodal networks (AGVs, hoists, lifts, suspended monorail systems, etc.) interact each other via common shared workstations as to provide a variety of demand-responsive workpiece transportation/handling services. The set of transport modes provides connection support for production flows treated as agents trying to realize their origin-destination routes in the MTN. The aim is to provide a declarative model enabling to state a constraint satisfaction problem aimed at multimodal transportation processes (MTP) scheduling, while servicing production flows. In other words, assuming a given topology of MTN, the main objective is to provide the declarative modeling framework enabling to refine conditions guaranteeing the MTP cyclic steady states reachability.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bielli, M., Boulmakoul, A., Mouncif, H.: Object modeling and path computation for multimodal travel systems. European Journal of Operational Research 175(3), 1705–1730
Bernaer, S.: A Multi Agent System to Control Complexity in Multi Modal Transport. In: Proceedings of the IEEE Conf. on Cybernetics and Intelligent Systems, pp. 1–6 (2006)
Bocewicz, G., Banaszak, Z.: Declarative approach to cyclic scheduling of multimodal processes. In: Golińska, P. (ed.) EcoProduction and Logistics, vol. 1, pp. 203–238. Springer, Heidelberg (2013)
Bocewicz, G., Banaszak, Z.: Declarative approach to cyclic steady states space refinement: periodic processes scheduling. International Journal of Advanced Manufacturing Technology (in print, 2013), doi:10.1007/s00170-013-4760-0
Bocewicz, G., Wójcik, R., Banaszak, Z.: Cyclic Scheduling for Supply Chain Network. In: Rodríguez, J.M.C., Pérez, J.B., Golinska, P., Giroux, S., Corchuelo, R. (eds.) Trends in PAAMS. AISC, vol. 157, pp. 39–47. Springer, Heidelberg (2012)
Korytkowski, P., Wisniewski, T., Zaikin, O.: Multi-criteria approach to comparison of inspection allocation for multi-product manufacturing systems in make-to-order sector. Control and Cybernetics 39(1), 97–116 (2010)
Levner, E., Kats, V., Alcaide, D., Pablo, L., Cheng, T.C.E.: Complexity of cyclic scheduling problems: A state-of-the-art survey. Computers & Industrial Engineering 59(2), 352–361 (2010)
Friedrich, M.: A multi-modal transport model for integrated planning. In: Proceedings of 8th World Conference on Transport Research, vol. 2, pp. 1–14. Elsevier (1999)
Polak, M., Majdzik, P., Banaszak, Z., Wójcik, R.: The performance evaluation tool for automated prototyping of concurrent cyclic processes. Fundamenta Informatice 60(1-4), 269–289 (2004)
Song, J.-S., Lee, T.-E.: Petri net modeling and scheduling for cyclic job shops with blocking. Computers & Industrial Engineering 34(2), 281–295 (1998)
Trouillet, B., Korbaa, O., Gentina, J.-C.K.: Formal Approach for FMS Cyclic Scheduling. IEEE SMC Transactions, Part C 37(1), 126–137 (2007)
Von Kampmeyer, T.: Cyclic scheduling problems, Ph.D. Dissertation, Fachbereich Mathematik/Informatik, Universität Osnabrück (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bocewicz, G., Nielsen, P., Banaszak, Z., Dang, Q.V. (2013). Multimodal Processes Cyclic Steady States Scheduling. In: Corchado, J.M., et al. Highlights on Practical Applications of Agents and Multi-Agent Systems. PAAMS 2013. Communications in Computer and Information Science, vol 365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38061-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-38061-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38060-0
Online ISBN: 978-3-642-38061-7
eBook Packages: Computer ScienceComputer Science (R0)