Email this article Bio-Soft Computational and Tabu Search Methods for Solving a Multi-Task Project Scheduling Problem
Abstract
This article presents a novel integrated method in which bio-soft computational and tabu search methods are both used to solve a multi-task project scheduling problem. In this scheduling problem, the main challenge is to determine the most reliable completion time. To solve this problem, we first use our proposed bio-soft computational method. Next, a tabu search method is used to verify the final results of the bio-soft computational method. The bio-soft computational method includes molecular techniques, and the tabu search method is an intelligent optimization technique. Based upon this integrated method’s success solving a multi-task project scheduling problem, this article proposes that this method can help decision makers in their computational project scheduling.
Keywords
References
[1] J. Watada, D. J.-F. Jeng, and I. Kim, “Application of DNA computing to group control of elevators,” 2005 Anniver-sary Symposium on the Romanian Society for Fuzzy Sys-tems & A. I., Iasi, Romania, 2005, pp. 9-19.
[2] J. Watada, S. Kojima, S. Ueda, and O. Ono, “DNA com-puting approach to optimal decision problems,” Interna-tional Journal of Innovative Computing, Information and Control, ICIC International, vol. 2, no. 1, 2006, pp. 273-282.
[3] I. Kim and J. Watada, “Decision making with an interpre-tive structural modeling method using a DNA-based algo-rithm,” IEEE Transactions on NanoBioscience, IEEE Pub-lishing, vol. 8, no. 2, 2009, pp. 181-191.
http://dx.doi.org/10.1109/TNB.2009.2023788
PMid:19497835
[4] I. Kim, J. Watada, and W. Pedrycz, “A DNA-based algo-rithm for arranging weighted cliques,” Simulation Model-ling Practice and Theory, Elsevier B.V., vol. 16, issue 10, 2008, pp. 1561-1570.
[5] I. Kim, Y. Chu, D. J.-F. Jeng, J. Watada, and J.-Y. Wu, “Building a bio-inspired reinforcement medical network system for optimal relationships in medical communica-tions,” International Journal of Biomedical Soft Comput-ing and Human Sciences, Biomedical Fuzzy Systems Asso-ciation, vol. 15, no. 2, 2009, pp. 9-16.
[6] R. A. Gardner, “The process-focused organization,” Ame-rican Society for Quality, 2004, pp. 27-38.
[7] W. J. Stevenson, “Operations management: ninth edition,” McGraw-Hill, Irwin, 2007, pp. 720-759.
[8] R. W. Conway, W. L. Maxwell, and L. W. Miller, “Theory of scheduling,” Dover Publications, Inc., 2003, pp. 103-131.
[9] R. Zhang and C. Wu, “A simulated annealing algorithm based on block properties for the job shop scheduling prob-lem with total weighted tardiness objective,” Computers & Operations Research, Elsevier B.V., vol. 38, no. 5, 2011, 854-867.
[10] L. M. Adleman, “Computing with DNA: The manipulation of DNA to solve mathematical problems is redefining what is meant by computation,” Scientific American, 1998, pp. 34-41.
[11] T. Tamura, “New experimental notes in genetic engineer-ing, note 1/2,” Yodosha Co., Ltd., 2005, pp. 61-160 in Japanese.
[12] T. Tamura, “New experimental notes in genetic engineer-ing, note 2/2,” Yodosha Co., Ltd., 2005, pp. 11-86 in Japa-nese.
[13] Z. F. Burton and J. M. Kaguni, “Experiments in molecular biology: biochemical applications,” Academic Press, 1997, pp. 11-20.
[14] D. T. Pham and D. Karaboga, “Intelligent Optimisation Techniques,” Springer-Verlag London, 2000, pp.149-181.
http://dx.doi.org/10.1007/978-1-4471-0721-7_3
[15] J. Kleinberg and E. Tardos, “Algorithm design,” Pearson Education, Inc., 2006, pp. 29-207.
[16] Z. F. Burton and J. M. Kaguni, “Experiments in molecular biology: Biochemical applications,” Academic Press, 1997, pp. 11-20.
Full Text: PDF