Metraipolis › archive › dc_d3aa84d206f2

A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model — Europe PMC PMID:33264317

Source
Europe PMC (en)
Original
https://europepmc.org/article/MED/33264317
DOI
10.1371/journal.pone.0242083
License (as archived)
solo-consultazione
Archived
2026-10-08T08:28:26.188Z
SHA-256 of the archived text
51a4dcab80dd01ba560f46ecce9ec0ab70043b6c29d772836d402ea034c42086
Stable URL of this page
https://metraipolis.com/documento/dc_d3aa84d206f2

How to cite

A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model — Europe PMC PMID:33264317 — Europe PMC (en), https://europepmc.org/article/MED/33264317 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_d3aa84d206f2 (Metraipolis archive dc_d3aa84d206f2, sha256 51a4dcab80dd01ba560f46ecce9ec0ab70043b6c29d772836d402ea034c42086)
BibTeX
@misc{dcd3aa84d206f2,
  title = {A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model — Europe PMC PMID:33264317},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/33264317},
  note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_d3aa84d206f2; sha256 51a4dcab80dd01ba560f46ecce9ec0ab70043b6c29d772836d402ea034c42086},
  year = {2026}
}

Archived text

The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/33264317. Agents can read the archived copy with the MCP tool read_document.