Evolutionary DNA Computing Algorithm for Job Scheduling Problem

ABSTRACT DNA computing techniques have interesting properties such as vast parallel computation attainment, organic edges, and tiny parts. These properties have attracted researchers from various fields (Bioinformatics, Biochemistry, and others). These techniques mainly rest on biochemical responses of molecules of DNA. Nonetheless, these biochemical responses might anneal in unsystematic fashion and conceivably generate inappropriate computations. This motivates prospects to utilize evolutionary computation as it lays importance on probabilistic and optimization search approaches. In this research study, the ability of DNA computing is demonstrated and verified by selecting the job scheduling problem (JSP). JSP can be easily tackled by a human or by using standard computers. A proposed evolutionary DNA algorithm is presented in this paper to solve the JSP; the proposed technique produces promising and better results than the standard DNA computing algorithm. Through adding supportive operations to the evolutionary operations, the performance becomes better; in addition, it has more solutions at the end, and therefore, the possibility of having an optimum or near optimum solution is increased, and the average number of solutions is improved.

[1]  Thomas Bäck,et al.  Evolutionary Computation as a Paradigm for DNA-Based Computing , 2002 .

[2]  Tomasz Popławski,et al.  [DNA computing]. , 2011, Postepy biochemii.

[3]  Fred W. Glover,et al.  Polynomial unconstrained binary optimisation - Part 2 , 2011, Int. J. Metaheuristics.

[4]  Chabane Djeraba,et al.  Mathematical Tools for Data Mining: Set Theory, Partial Orders, Combinatorics , 2008, Advanced Information and Knowledge Processing.

[5]  Henry C. W. Lau,et al.  An automatic system designed for the monitoring of cutting tools using real-time control concepts and fuzzy approaches , 2002, Int. J. Comput. Integr. Manuf..

[6]  Deming Lei,et al.  Variable neighbourhood search for minimising tardiness objectives on flow shop with batch processing machines , 2011 .

[7]  Richard J. Lipton,et al.  On the Computational Power of DNA , 1996, Discret. Appl. Math..

[8]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..

[9]  Masahito Yamamoto,et al.  Solutions of Shortest Path Problems by Concentration Control , 2001, DNA.

[10]  Mostafa Zandieh,et al.  A variable neighbourhood search algorithm for the flexible job-shop scheduling problem , 2010 .

[11]  Zeinali Sirous,et al.  Rapid and sensitive detection of point mutations and DNA polymorphisms in Factor IX Gene by using the Single Strand Conformation Polymorphism ( SSCP ) , 2005 .

[12]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[13]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[14]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[15]  Andrea Rossi,et al.  Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method , 2007 .

[16]  F. Chan,et al.  IFSJSP: A novel methodology for the Job-Shop Scheduling Problem based on intuitionistic fuzzy sets , 2013 .

[17]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[18]  Emile H. L. Aarts,et al.  Intelligent Algorithms in Ambient and Biomedical Computing , 2006 .

[19]  Ahmed T. Sadiq,et al.  Improving DNA Computing Using Evolutionary Techniques , 2016 .

[20]  New perspectives on the Ising model , 2005, cond-mat/0506117.

[21]  Toric Sasaki–Einstein manifolds and Heun equations , 2005, hep-th/0512124.

[22]  Jian-hua Xiao,et al.  A membrane evolutionary algorithm for DNA sequence design in DNA computing , 2012 .

[23]  Peng Wang,et al.  A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems , 2010, Appl. Soft Comput..

[24]  Masatoshi Sakawa,et al.  Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms , 2000, Eur. J. Oper. Res..

[25]  S. G. Deshmukh,et al.  FMS scheduling with knowledge based genetic algorithm approach , 2011, Expert Syst. Appl..

[26]  Masoud Rabbani,et al.  Cell formation problem with alternative process plans and alternative routes considering defect rate , 2013 .

[27]  Masoud Rabbani,et al.  A novel hybrid SA/GA algorithm for solving an integrated cell formation–job scheduling problem with sequence-dependent set-up times , 2016 .

[28]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

[29]  Deming Lei,et al.  Solving fuzzy job shop scheduling problems using random key genetic algorithm , 2010 .

[30]  Sergio Nesmachnow,et al.  An overview of metaheuristics: accurate and efficient methods for optimisation , 2014, Int. J. Metaheuristics.

[31]  Lila Kari,et al.  Using DNA to solve the Bounded Post Correspondence Problem , 2000, MCU.

[32]  Yun-Chia Liang,et al.  Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem , 2006 .

[33]  Felix T.S. Chan,et al.  A superiority search and optimisation algorithm to solve RFID and an environmental factor embedded closed loop logistics model , 2011 .

[34]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[35]  Qun Niu,et al.  Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time , 2008, Appl. Math. Comput..

[36]  Carlos A. Brizuela,et al.  Improving the design of sequences for DNA computing: A multiobjective evolutionary approach , 2013, Appl. Soft Comput..

[37]  Tom Page,et al.  A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints , 2011 .

[38]  Basudeb Datta,et al.  Two-dimensional weak pseudomanifolds on eight vertices , 2002 .

[39]  Mitsunori Ogihara,et al.  Simulating Boolean circuits on a DNA computer , 1997, RECOMB '97.

[40]  Felix T.S. Chan,et al.  Managing warehousing in an agile supply chain environment: an F-AIS algorithm based approach , 2011 .

[41]  Yong Deng,et al.  A new optimal consensus method with minimum cost in fuzzy group decision , 2012, Knowl. Based Syst..

[42]  Felix T. S. Chan,et al.  A resource-constrained assembly job shop scheduling problem with Lot Streaming technique , 2009, Comput. Ind. Eng..

[43]  E. Shapiro,et al.  An autonomous molecular computer for logical control of gene expression , 2004, Nature.

[44]  Chabane Djeraba,et al.  Mathematical Tools for Data Mining , 2014, Advanced Information and Knowledge Processing.