Cargando…
A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model
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 ope...
Autores principales: | Tian, Xiang, Liu, Xiyu, Zhang, Hongyan, Sun, Minghe, Zhao, Yuzhen |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7710087/ https://www.ncbi.nlm.nih.gov/pubmed/33264317 http://dx.doi.org/10.1371/journal.pone.0242083 |
Ejemplares similares
-
An Improved Genetic Algorithm for Solving the Multi-AGV Flexible Job Shop Scheduling Problem
por: Meng, Leilei, et al.
Publicado: (2023) -
Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem
por: Peng, Chong, et al.
Publicado: (2019) -
Multi-population genetic algorithm with ER network for solving flexible job shop scheduling problems
por: Shi, Xiaoqiu, et al.
Publicado: (2020) -
A Genetic Approach to the Job Shop Scheduling Problem with Interval Uncertainty
por: Díaz, Hernán, et al.
Publicado: (2020) -
A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem
por: Escamilla Serna, Nayeli Jazmin, et al.
Publicado: (2021)