Job shop scheduling problem based on DNA computing

DOI10.1016/S1004-4132(06)60112-6MaRDI QIDQ2936305zbMATH OpenFDO

Authors Zhixiang Yin, Jianzhong Cui, Yan Yang, Ying Ma

Publication date 15 December 2014

Published in Journal of Systems Engineering and Electronics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1004-4132(06)60112-6

zbMATH Keywords

DNA computingjob shop scheduling problemtournamentweighted

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1962032
• scientific article; zbMATH DE number 5050497
• A biological algorithm to solve the assignment problem based on DNA molecules computation
• Algorithm of DNA computing on optimal assignment problems
• scientific article; zbMATH DE number 1156876

Cited in

(4)

• A variable neighborhood MOEA/D for multiobjective test task scheduling problem
• scientific article; zbMATH DE number 1962032 (Why is no real title available?)
• scientific article; zbMATH DE number 5050497 (Why is no real title available?)
• Solving two-dimensional cutting stock problem via a DNA computing algorithm

This page was built for publication: Job shop scheduling problem based on DNA computing

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