Abstract
One method for enhancing the quality of work life for companies or other organisations is to rearrange employees by detecting and analysing employees’ close interpersonal relationships based on business implications. Although human resource managers can use various methods to enhance the quality of work life, one of the most widely used and effective methods is job rotation. In this paper, we select a model of a workplace where employees in a variety of job functions are sharing tasks, information, etc. through close interpersonal relationships, and we suppose a personnel network which contains strong terms of mutual understanding. However, with a huge number of employees it becomes extremely difficult to find the maximum clique of employees for rearrangement, meaning this is NP-hard. Therefore, we employ DNA computing, also known as molecular computation, to this rearranging problem. The goal of this paper is to propose a way to apply DNA computing to this human resource management problem, and to measure its effectiveness in rearranging employees to analyse the density of subgroups in a personnel network with valued relationships.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Miyakawa, T.: Management Information System, 3rd edn., pp. 87–98. Chuo-keizaisha Co., Ltd. (2004) (in Japanese)
Umezu, H.: MBA Management of Human Resources and Organisation, pp. 41–60. Seisansei-Shuppan (2003) (in Japanese)
Werther Jr., W.B., Keith, D.: Human Resources and Personnel Management, pp. 145–157. McGraw-Hill, New York (1995)
Schwalbe, K.: Information Technology Project Management., 4th edn., pp. 366–384. Thomson Course Technology (2006)
Wasserman, S., Faust, K.: Social Network Analysis, pp. 149–290. Cambridge University Press, Cambridge (1999)
van Noort, D., Gast, F.-U., McCaskill, J.S.: DNA Computing in Microreactors. Special Lectures in DNA Computing, Graduate School of Information, Production and Systems, Waseda University, pp. 1-10 (submitted, 2005)
Adleman, L.: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1024 (1994)
Rose, J.A., Hagiya, M., Deaton, R.J., Suyama, A.: A DNA-based in vitro Genetic Program. Journal of Biological Physics 28, 493–498 (2002)
van Noort, D., Landweber, L.F.: Towards a Re-programmable DNA Computer. In: Chen, J., Reif, J.H. (eds.) DAN 2003. LNCS, vol. 2943, pp. 190–196. Springer, Heidelberg (2004)
Rose, J.A., Deaton, R.J., Suyama, A.: Statistical thermodynamic analysis and design of DNA-based computers. Natural Computing 3, 443–459 (2004)
Sakamoto, K., Kiga, D., Komiya, K., Gouzu, H., Yokoyama, S., Ikeda, S., Sugiyama, H., Hagiya, M.: State Transitions by molecules. Biosystems 52, 81–91 (1999)
Watada, J., Jeng, D.J.-F., Kim, I.: Application of DNA Computing to Group Control of Elevators. In: Anniversary Symposium on the Romanian Society for Fuzzy Systems & A.I., Iasi, Romania May 5–7 (2005)
Ouyang, Q., Kaplan, P.D., Liu, S., Libacher, A.: DNA Solution of the Maximal Clique Problem. Science 278, 446–449 (1997)
Yasuda, Y.: Practice Network Analysis, pp. 55–63. Shinyosha Co., Ltd. (2004) (in Japanese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, I., Jeng, D.JF., Watada, J. (2006). Analysing the Density of Subgroups in Valued Relationships Based on DNA Computing. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2006. Lecture Notes in Computer Science(), vol 4253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11893011_122
Download citation
DOI: https://doi.org/10.1007/11893011_122
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46542-3
Online ISBN: 978-3-540-46544-7
eBook Packages: Computer ScienceComputer Science (R0)