Evolutionary DNA Computing Algorithm for Job Scheduling Problem

REFERENCES

• M. Adleman , “Molecular computation of solutions to combinatorial problems,” Science , Vol. 266, pp. 1021–24, Nov. 1994.
   PubMed Web of Science ®Google Scholar
• A. Kumar , and P. Jindal , “Towards the solution of NP complete problems,” J. Appl. Comp. Sci. Math. , Vol. 4, no. 9, pp. 63–6. 2010.
   Google Scholar
• D. Boneh , C. Dunworth , J. Lipton , and L. Sgall   I , “On the computational power of DNA,” Discrete Appl. Math. , Vol. 71, pp. 79–94, Dec. 1996.
   Web of Science ®Google Scholar
• L. Kari , G. Gloor , and Y. Sheng , “Using DNA to solve the bounded post correspondence problem,” Theor. Comput. Sci. , Vol. 231, no. 2, pp. 192–203, Jan. 2000.
   Web of Science ®Google Scholar
• M. Mitchell , An Introduction to Genetic Algorithms . Cambridge, MA : MIT Press. ISBN 9780585030944, 1996.
   Google Scholar
• S. Nesmachnow , “An overview of metaheuristics: Accurate and efficient methods for optimisation,” Int. J. Metaheuristics , Vol. 3, no. 4, pp. 320–47, Apr. 2014.
   Google Scholar
• F. Glover , J.-K. Hao , and G. Kochenberger , “Polynomial unconstrained binary optimisation – Part 2,” Int. J. Metaheuristics , Vol. 1, no. 3, pp. 317–54, Dec. 2011.
   Google Scholar
• R. Graham , “Bounds on multiprocessing timing anomalies,” Bell Syst. Tech. J. , Vol. 45, no. 9, pp. 1563–81. Mar. 1996.
   Google Scholar
• X. Zhanga , Y. Denga , F. T. S. Chanc , P. Xud , S. Mahadevanb , and Y. Hue , “IFSJSP: A novel methodology for the job-shop scheduling problem based on intuitionistic fuzzy sets,” Int. J. Prod. Res. , Vol. 51, no. 17, pp. 5100–19, Jun. 2013.
   Web of Science ®Google Scholar
• M. Sakawa and R. Kubota , “Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy due date through genetic algorithms,” Eur. J. Oper. Res. , Vol. 120, no. 2, pp. 393–407, Jan, 2000.
   Web of Science ®Google Scholar
• A. Prakash , F. T. S. Chan , and S. Deshmukh , “FMS scheduling with knowledge based genetic algorithm approach,” Expert Syst. Appl. , Vol. 38, no. 4, pp. 3161–71, 2011.
   Web of Science ®Google Scholar
• G. Zhang , L. Gao , and Y. Shi , “An effective genetic algorithm for the flexible job-shop scheduling problem,” Expert Syst. Appl. , Vol. 38, no. 4, pp. 3563–73, Apr. 2011.
   Web of Science ®Google Scholar
• E. Nowicki and C. Smutnicki , “An advanced Tabu search algorithm for the job shop problem,” J. Scheduling , Vol. 8, no. 2, pp. 145–59, Apr. 2005.
   Web of Science ®Google Scholar
• J. Liu , et al. , “A new optimal consensus method with minimum cost in fuzzy group decision,” Knowl. Based Syst. , Vol. 35, pp. 357–60, Nov. 2012.
   Web of Science ®Google Scholar
• A. Rossi and G. Dini , “Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method,” Robot. Comput. Integr. Manuf. , Vol. 23, no. 5, pp. 503–16, Nov. 2007.
   Web of Science ®Google Scholar
• L. Xing , et al. , “A knowledge-based ant colony optimization for flexible job shop scheduling problems,” Appl. Soft Comput. , Vol. 10, no. 3, pp. 888–96, Jun. 2010.
   Web of Science ®Google Scholar
• M. Tasgetiren , et al. , “Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem,” Int. J. Prod. Res. , Vol. 44, no. 22, pp. 4737–54, Feb. 2007.
   Web of Science ®Google Scholar
• T. Wong , F. T. S. Chan , and L. Chan , “A resource-constrained assembly job shop scheduling problem with lot streaming technique,” Comput. Ind. Eng. , Vol. 57, no. 3, pp. 983–95, Oct. 2009.
   Web of Science ®Google Scholar
• M. Amiri , M. Zandieh , M. Yazdani , and A. Bagheri , “A variable neighborhood search algorithm for the flexible job-shop scheduling problem,” Int. J. Prod. Res. , Vol. 48, no. 19, pp. 5671–89, Jan. 2010.
   Web of Science ®Google Scholar
• R. W. L. Ip , I. K. Hui , H. Lau , and F. T. S. Chan , “An automatic system designed for the monitoring of cutting tools using real-time control concepts and fuzzy approaches,” Int. J. Comput. Int. Manuf. , Vol. 15, no. 5, pp. 379–93, Nov. 2010.
   Google Scholar
• V. Kumar , N. Mishra , F. T. S. Chan , and A. Verma , “Managing warehousing in an agile supply chain environment: An F-AIS algorithm based approach,” Int. J. Prod. Res. , Vol. 49, no. 21, pp. 6407–26, Jan. 2011.
   Web of Science ®Google Scholar
• V. Kumar and F. T. S. Chan , “A superiority search and optimization algorithm to solve RFID and an environmental factor embedded closed loop logistics model,” Int. J. Prod. Res. , Vol. 49, no. 16, pp. 4807–31, Oct. 2010.
   Web of Science ®Google Scholar
• D. Lei , “Solving fuzzy job shop scheduling problems using random key genetic algorithm,” Int. J. Adv. Manuf. Technol. , Vol. 49, no. 1, pp. 253–62, Oct. 2010.
   Web of Science ®Google Scholar
• D. Lei and X. Guo , “Variable neighborhood search for minimizing tardiness objectives on flow shop with batch processing machines,” Int. J. Prod. Res. , Vol. 49, no. 2, pp. 519–29, Mar. 2010.
   Web of Science ®Google Scholar
• H. Rafieia , M. Rabbania , H. Gholizadeha , and H. Dashtia , “A novel hybrid SA/GA algorithm for solving an integrated cell formation–job scheduling problem with sequence-dependent set-up times,” Int. J. Manage. Sci. Eng. Manage. , Vol. 11, no. 3, pp. 134–42, Mar. 2015.
   Google Scholar
• H. Rafiei , M. Rabbani , H. Dashti , and A. Nourmohammadzadeh , “Cell formation problem with alternative process plans and alternative routes considering defect rate,” Int. J. Sci. Eng. Res. , Vol. 4, pp. 1817–23, May 2013.
   Google Scholar
• S. Junnarkar , In Just a Few Drops, A Breakthrough in Computing . New York : Times, May 21, 1997.
   Google Scholar
• F. Mancini , “New perspectives on the Ising model,” Eur. Phys. J. B , Vol. 45, no. 4, pp. 497–514, Jun. 2005.
   Web of Science ®Google Scholar
• M. Ogihara and A Ray , “Simulating Boolean circuits on a DNA computer,” Algorithmica , Vol. 25, no. 2–3, pp. 239–50, 1999.
   Web of Science ®Google Scholar
• T. Bäck , N. Kok , and G. Rozenberg , “Evolutionary computation as a paradigm for DNA-based computing,” Nat. Comput. Series , pp. 15–40, 2002.
   Google Scholar
• T. Bäck , N. Kok , and G. Rozenberg , “Evolutionary computation as a paradigm for DNA-based computing,” in Evolution as Computation , L.F. Landweber and E. Winfree , Eds., DIMACS workshop, Princeton, January 1999, Heidelberg : Springer-Verlag, 2003, pp. 15–40.
   Google Scholar
• News.nationalgeographic.com . 2018. Computer Made from DNA and Enzymes. [online] Available at: https://news.nationalgeographic.com/news/2003/02/0224_030224_DNAcomputer.html [Accessed 26 Mar. 2018].
   Google Scholar
• Y. Benenson , B. Gil , U. Ben-Dor , R. Adar , and E. Shapiro , “An autonomous molecular computer for logical control of gene expression,” Nature , Vol. 429, no. 6990, pp. 423–29, Apr. 2004.
   PubMed Web of Science ®Google Scholar
• N. Dimitrova , “Intelligent algorithms in ambient and biomedical computing,” The Many Strands DNA Comput. , Vol. 7, pp. 21–35, 2006.
   Google Scholar
• N. Nafise , Z. Sirous , L Manigeh , K. Esmat , and K. Morteza , “Rapid and sensitive detection of point mutations and DNA polymorphisms in factor IX gene by using the single strand conformation polymorphism (SSCP),” The Fourth Biotechnology Congress, Kermanshah , Aug. 2005.
   Google Scholar
• S. Abdullah , “An improved DNA computing approach using heuristic techniques,” Ph.D. dissertation, Dept. Comput. Sci., Univ. Technol., Baghdad, 2008.
   Google Scholar
• Q. Niu , B. Jiao , and X. Gu , “Particle swarm optimization combined with for job shop scheduling problem with fuzzy processing time,” Appl. Math. Comput. , Vol. 205, no. 1, pp. 148–58, Nov. 2008.
   Web of Science ®Google Scholar
• M. Rajkumar , P. Asokan , N. Anilkumar , and T. Page , “A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints,” Int. J. Prod. Res. , Vol. 49, no. 8, pp. 2409–23, May 2010.
   Web of Science ®Google Scholar
• X. JianHua , Z. XingYi , and   XU , “A membrane evolutionary algorithm for DNA sequence design in DNA computing,” Comput. Sci. Technol. , Vol. 57, no. 6, pp. 698–706, Feb. 2012.
   Google Scholar
• V. Cervantes-Salido , O. Jaime , C. Brizuela , and I. Martínez-Pérez , “Improving the design of sequences for DNA computing: A multiobjective evolutionary approach,” Appl. Soft Comput. , Vol. 13, no. 12, pp. 4594–607, Dec. 2013.
   Web of Science ®Google Scholar
• M. Adleman , Computing with DNA, The Manipulation of DNA to Solve Mathematical Problems is Redefining What is Meant by Computation . New York : Scientific American, Inc, Aug. 1998.
   Google Scholar
• M. Amos , “DNA Computing.” in Encyclopedia of Complexity and Systems Science . R. Meyers, Ed., New York : Springer, 2009.
   Google Scholar
• R Sekhar , “DNA Computing-graph algorithms. Department of Mathematics, Indian Institute of Technology,” This work is partially supported by Com2MaC-KOSEF, Korea , 2010.
   Google Scholar
• G. Ibrahim , “Improving DNA Computing using evolutionary algorithms,” Ph.D. dissertation, Dept. Software Eng., College of Eng., Salahaddin Univ., Hawler, Kurdistan , 2012.
   Google Scholar
• M. Yamamoto , N. Matsuura , T. Shiba , Y. Kawazoe , and A. Ohuchi , “Computing, Solutions of Shortest Path Problems by Concentration Control,” in DNA Computing. DNA 2001. Lecture Notes in Computer Science , N. Jonoska, N.C. Seeman, Eds., Berlin, Heidelberg : Springer, Vol. 2340, pp. 203–12, 2002.
   Google Scholar
• R. K. Ahuja , T. L. Magnanti , J. B. Orlin , Network Flows: Theory, Algorithms, and Applications . 1st Edition, New Jeney, ISBN-13: 978-0136175490, 1993.
   Google Scholar
• D. Datta and N. Nilakantan , “Two-dimensional weak pseudomanifolds on eight vertices,” Proc. Indian Acad. Sci. - Math. Sci. , Vol. 112, no. 2, pp. 257–81, [May. 2002.]
   Google Scholar
• T. Ootaa and Y. Yasuib , “Toric Sasaki–Einstein manifolds and Heun equations,” Nucl. Phys., Section B , Vol. 742, no. 1–3, pp. 275–94, May 2006.
   Google Scholar
• D. A. Simovici and D. Chabane , Tools for Data Mining Set Theory, Partial Orders, Combinatorics . London : Springer London, 2014.
   Google Scholar
• G. J. Ibrahim , T. A. Rashid and A. T. Sadiq , “Improving DNA computing using evolutionary techniques,” Int. J. Adv. Comput. Sci. Appl. (IJACSA) , Vol. 7, no 3, pp. 109–21, 2016. https://doi.org/10.14569/IJACSA.2016.070316.
   Web of Science ®Google Scholar