DNA based algorithms for some scheduling problems

DOI10.1007/3-540-36605-9_61MaRDI QIDQ4418448zbMATH OpenFDO

Authors Jacek Blazewicz, Piotr Formanowicz, Radosław Urbaniak

Publication date 10 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2611/26110673.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Job shop scheduling problem based on DNA computing
• DNA computing-based algorithm for assignment problems
• Algorithm of DNA computing on optimal assignment problems
• scientific article; zbMATH DE number 1156876
• On the computational power of DNA

Cited in

(4)

• Job shop scheduling problem based on DNA computing
• Algorithm of DNA computing on optimal assignment problems
• DNA computing-based algorithm for assignment problems
• New algorithms for some NP-optimization problems by DNA computing

This page was built for publication: DNA based algorithms for some scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418448)