Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Sequence Networks of Rotating Machines01:24

Sequence Networks of Rotating Machines

389
A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
389
Gaussian Elimination: Problem Solving01:30

Gaussian Elimination: Problem Solving

66
Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...
66
Distributed Loads: Problem Solving01:21

Distributed Loads: Problem Solving

937
Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...
937
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

185
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
185
Mathematical Modeling: Problem Solving01:29

Mathematical Modeling: Problem Solving

131
Mathematical modeling transforms real-world scenarios into mathematical expressions, allowing for structured problem-solving and analysis. This process involves defining the situation, assigning variables to measurable quantities, selecting an appropriate model, and solving the resulting equation. Such models are invaluable in finance, providing precise methods to evaluate investments, loans, and repayment structures.A widely used example is the calculation of fixed monthly payments on a loan,...
131
Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

591
Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
591

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Solving multi-scenario hybrid flow shop scheduling problem based on an improved probe machine model.

PloS one·2025
Same author

A pan-cancer study of spalt-like transcription factors 1/2/3/4 as therapeutic targets.

Archives of biochemistry and biophysics·2021
Same author

Cerium oxide modified iridium nanorods for highly efficient electrochemical water splitting.

Chemical communications (Cambridge, England)·2021
Same author

Network analysis of anxiety and depressive symptoms among nursing students during the COVID-19 pandemic.

Journal of affective disorders·2021
Same author

Colorimetric and Ratiometric Fluorescence Detection of HSO<sub>3</sub><sup>-</sup> With a NIR Fluorescent Dye.

Journal of fluorescence·2021
Same author

Augment the efficacy of eradicating metastatic lesions and tumor proliferation in breast cancer by honokiol-loaded pH-sensitive targeted lipid nanoparticles.

Colloids and surfaces. B, Biointerfaces·2021

Related Experiment Video

Updated: Nov 27, 2025

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

12.0K

A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model.

Xiang Tian1, Xiyu Liu1, Hongyan Zhang1

  • 1Business School, Shandong Normal University, Jinan, China.

Plos One
|December 2, 2020
PubMed
Summary

A novel DeoxyriboNucleic Acid (DNA) algorithm offers an efficient solution for the job shop scheduling problem. This DNA computing approach generates all possible solutions to find an optimal schedule, outperforming existing methods.

More Related Videos

Design and Synthesis of a Reconfigurable DNA Accordion Rack
07:44

Design and Synthesis of a Reconfigurable DNA Accordion Rack

Published on: August 15, 2018

7.3K
Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

17.3K

Related Experiment Videos

Last Updated: Nov 27, 2025

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy
11:53

The Modular Design and Production of an Intelligent Robot Based on a Closed-Loop Control Strategy

Published on: October 14, 2017

12.0K
Design and Synthesis of a Reconfigurable DNA Accordion Rack
07:44

Design and Synthesis of a Reconfigurable DNA Accordion Rack

Published on: August 15, 2018

7.3K
Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
10:58

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

17.3K

Area of Science:

  • Computational Biology
  • Operations Research
  • Algorithm Design

Background:

  • The job shop scheduling problem (JSSP) is a complex combinatorial optimization problem with significant real-world applications.
  • Traditional algorithms often struggle with the computational complexity of finding optimal solutions for JSSP.
  • The potential of bio-inspired computing, such as DNA computing, for tackling such problems is an active area of research.

Purpose of the Study:

  • To propose a novel DeoxyriboNucleic Acid (DNA) algorithm for solving the job shop scheduling problem.
  • To develop an effective encoding scheme and utilize DNA computing operations for JSSP.
  • To evaluate the performance and complexity of the proposed DNA algorithm against existing heuristics.

Main Methods:

  • Development of a specific encoding scheme to represent JSSP instances for DNA computation.
  • Application of DNA computing operations to generate and manipulate potential solutions.
  • Construction of an initial solution followed by exhaustive generation of all possibilities.
  • Analysis of the algorithm's time complexity, proving an O(n^2) bound.
  • Validation of the optimal schedule's final strand length.

Main Results:

  • The proposed DNA algorithm successfully generates all possible solutions to find an optimal schedule.
  • The algorithm demonstrates a proven time complexity of O(n^2).
  • Experimental results on 58 benchmark instances indicate that the DNA algorithm outperforms other comparative heuristics in terms of solution quality and/or efficiency.

Conclusions:

  • The developed DNA algorithm provides a viable and efficient approach to solving the job shop scheduling problem.
  • DNA computing offers a powerful paradigm for addressing complex combinatorial optimization problems.
  • The proposed method shows significant promise for practical applications in scheduling and related optimization tasks.