Abstract
Automata on general directed hypergraphs have been recently introduced based on the algebraic representation of hypergraphs inside graphoids. In this paper, we employ this mechanism for the construction of automata recognizing mixed model assembly lines.
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
Arnold, A., Dauchet, M.: Théorie des magmoides. I and II. RAIRO Theoret. Inform. Appl. 12, 235–257 (1978); 13, 135–154
Blume, C.: Recognizable Graph Languages for the Verification of Dynamic Systems. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 384–387. Springer, Heidelberg (2010)
Blume, C., Bruggink, H.J.S., Friedrich, M., König, B.: Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. Journal of Visual Languages & Computing 24, 192–206 (2013)
Boysen, N., Fliedner, M., Scholl, A.: Assembly line balancing: Joint precedence graphs under high product variety. IIE Transactions 41, 183–193 (2009)
Bozapalidis, S., Kalampakas, A.: An Axiomatization of Graphs. Acta Inform. 41, 19–61 (2004)
Bozapalidis, S., Kalampakas, A.: Graph Automata. Theoret. Comput. Sci. 393, 147–165 (2008)
Bukchin, J., Dar-El, E.M., Rubinovitz, J.: Mixed model assembly line design in a make-to-order environment. Computers and Industrial Engineering 41, 405–421 (2001)
Kalampakas, A.: Graph Automata: The Algebraic Properties of Abelian Relational Graphoids. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 168–182. Springer, Heidelberg (2011)
Kriengkorakot, N., Pianthong, N.: The Assembly Line Balancing Problem: Review articles. KKU Engineering Journal 34, 133–140 (2007)
Engelfriet, J., Vereijken, J.J.: Context-free graph grammars and concatenation of graphs. Acta Informatica 34, 773–803 (1997)
Pil, F.K., Holweg, M.: Linking product variety to order-fulfillment strategies. Interfaces 34, 394–403 (2004)
Quernheim, D., Knight, K.: Towards Probabilistic Acceptors and Transducers for Feature Structures. In: Proc. 6th Workshop Syntax, Semantics and Structure in Statistical Translation, pp. 76–85. Association for Computational Linguistics (2012)
Salveson, M.E.: The Assembly Line Balancing Problem. Journal of Industrial Engineering 6, 18–25 (1955)
Tamura, T., Long, H., Ohno, K.: A sequencing problem to level part usage rates and work loads for a mixed-model assembly line with a bypass sub-line. International Journal of Production Research 60-61, 557–564 (1999)
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
Kalampakas, A., Spartalis, S., Iliadis, L. (2013). Automata on Directed Graphs for the Recognition of Assembly Lines. In: Iliadis, L., Papadopoulos, H., Jayne, C. (eds) Engineering Applications of Neural Networks. EANN 2013. Communications in Computer and Information Science, vol 383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41013-0_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-41013-0_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41012-3
Online ISBN: 978-3-642-41013-0
eBook Packages: Computer ScienceComputer Science (R0)