A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model
Related Experiment Video
Updated: Nov 27, 2025

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
Published on: October 14, 2017
Xiang Tian1, Xiyu Liu1, Hongyan Zhang1
1Business School, Shandong Normal University, Jinan, China.
Abstract:
A DNA (DeoxyriboNucleic Acid) algorithm is proposed to solve the job shop scheduling problem. An encoding scheme for the problem is developed and DNA computing operations are proposed for the algorithm. After an initial solution is constructed, all possible solutions are generated. DNA computing operations are then used to find an optimal schedule. The DNA algorithm is proved to have an O(n2) complexity and the length of the final strand of the optimal schedule is within appropriate range. Experiment with 58 benchmark instances show that the proposed DNA algorithm outperforms other comparative heuristics.
Related Concept Videos
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Gaussian Elimination: Problem Solving
Distributed Loads: Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Mathematical Modeling: Problem Solving
Statically Indeterminate Problem Solving

